Package org.apache.calcite.rel.rules

Class DpHyp

java.lang.Object

org.apache.calcite.rel.rules.DpHyp

public class DpHyp
extends Object

The core process of dphyp enumeration algorithm.

Field Summary

Fields

Modifier and Type	Field	Description
protected final RelBuilder	builder
protected final HyperGraph	hyperGraph

Constructor Summary

Constructors

Constructor	Description
DpHyp(HyperGraph hyperGraph, RelBuilder builder, RelMetadataQuery relMetadataQuery, int bloat)

Method Summary

Modifier and Type	Method	Description
@Nullable RelNode	getBestPlan()
void	startEnumerateJoin()	The entry function of the algorithm.
protected boolean	verifyDpResultRowType(RelNode plan, List<HyperGraph.NodeState> resultOrder)	Verify that the row type of plans generated by dphyp is equivalent to the origin plan.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Details

hyperGraph

protected final HyperGraph hyperGraph

builder

protected final RelBuilder builder

Constructor Details

DpHyp

public DpHyp(HyperGraph hyperGraph,
 RelBuilder builder,
 RelMetadataQuery relMetadataQuery,
 int bloat)

Method Details

startEnumerateJoin

public void startEnumerateJoin()

The entry function of the algorithm. We use a bitmap to represent a leaf node, which indicates the position of the corresponding leaf node in HyperGraph.

After the enumeration is completed, the best join order will be stored in the dpTable.

getBestPlan

public @Nullable RelNode getBestPlan()

verifyDpResultRowType

protected boolean verifyDpResultRowType(RelNode plan,
 List<HyperGraph.NodeState> resultOrder)

Verify that the row type of plans generated by dphyp is equivalent to the origin plan.

Parameters:

plan - plan generated by dphyp

resultOrder - node status ordered list

Returns:

true if the plan row type equivalent to the hyperGraph row type