/**
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.tajo.plan.joinorder;
import org.apache.tajo.algebra.JoinType;
import org.apache.tajo.plan.logical.JoinSpec;
import org.apache.tajo.plan.util.PlannerUtil;
import org.apache.tajo.util.graph.SimpleUndirectedGraph;
import java.util.List;
/**
* A join graph must be the connected graph
*/
public class JoinGraph extends SimpleUndirectedGraph<JoinVertex, JoinEdge> {
private boolean allowArbitraryCrossJoin = true;
public JoinEdge addJoin(JoinGraphContext context, JoinSpec joinSpec, JoinVertex left, JoinVertex right) {
JoinEdge edge = context.getCachedOrNewJoinEdge(joinSpec, left, right);
// TODO: the below will be improved after TAJO-1683
allowArbitraryCrossJoin &= PlannerUtil.isCommutativeJoinType(edge.getJoinType())
|| edge.getJoinType() == JoinType.LEFT_SEMI || edge.getJoinType() == JoinType.LEFT_ANTI;
this.addEdge(left, right, edge);
List<JoinEdge> incomeToLeft = getIncomingEdges(left);
if (incomeToLeft == null || incomeToLeft.isEmpty()) {
context.addRootVertexes(left);
}
if (context.getRootVertexes().size() > 1) {
// for the case of cycle
context.removeRootVertexes(right);
}
return edge;
}
public boolean allowArbitraryCrossJoin() {
return allowArbitraryCrossJoin;
}
}