Class Join

server/src/main/java/io/crate/planner/node/dql/join/Join.java:58–194

Plan that will execute a join. The join can be executed either with NestedLoop or HashJoin algorithms This Plan makes a lot of assumptions: limit and offset are already pushed down to left and right plan nodes where clause is already splitted to left and right plan nodes

 * If sth. else is selected a projection has to reorder those.
 */
public class Join implements ExecutionPlan, ResultDescription {

    private final ExecutionPlan left;
    private final ExecutionPlan right;
    private final JoinPhase joinPhase;

    private int limit;
    private int offset;
    private int numOutputs;

    private final int maxRowsPerNode;
    @Nullable
    private PositionalOrderBy orderBy;

    public Join(JoinPhase joinPhase,
                ExecutionPlan left,
                ExecutionPlan right,
                int limit,
                int offset,
                int maxRowsPerNode,
                int numOutputs,
                @Nullable PositionalOrderBy orderBy) {
        this.left = left;
        this.right = right;
        this.joinPhase = joinPhase;
        this.limit = limit;
        this.offset = offset;
        this.maxRowsPerNode = maxRowsPerNode;
        this.orderBy = orderBy;
        this.numOutputs = numOutputs;
    }

    public ExecutionPlan left() {
        return left;
    }

    public ExecutionPlan right() {
        return right;
    }

    public JoinPhase joinPhase() {
        return joinPhase;
    }

    @Override
    public ResultDescription resultDescription() {
        return this;
    }

    @Override
    public void setDistributionInfo(DistributionInfo distributionInfo) {
        joinPhase.distributionInfo(distributionInfo);
    }

    @Override
    public <C, R> R accept(ExecutionPlanVisitor<C, R> visitor, C context) {
        return visitor.visitJoin(this, context);
    }