duckdb::DPJoinNode Class Reference

Collaboration diagram for duckdb::DPJoinNode:

Public Member Functions
	DPJoinNode (JoinRelationSet &set, optional_ptr< NeighborInfo > info, JoinRelationSet &left, JoinRelationSet &right, double cost)
	Create an intermediate node in the join tree. base_cardinality = estimated_props.cardinality.
	DPJoinNode (JoinRelationSet &set)

Public Attributes
JoinRelationSet &	set
	Represents a node in the join plan.
optional_ptr< NeighborInfo >	info
	information on how left and right are connected
bool	is_leaf
JoinRelationSet &	left_set
	left and right plans
JoinRelationSet &	right_set
double	cost
idx_t	cardinality
	used only to populate logical operators with estimated cardinalities after the best join plan has been found.

Constructor & Destructor Documentation

DPJoinNode()

duckdb::DPJoinNode::DPJoinNode ( JoinRelationSet &  set )

explicit

Create a leaf node in the join tree set cost to 0 for leaf nodes cost will be the cost to produce an intermediate table

Member Data Documentation

cost

double duckdb::DPJoinNode::cost

The cost of the join node. The cost is stored here so that the cost of a join node stays in sync with how the join node is constructed. Storing the cost in an unordered_set in the cost model is error prone. If the plan enumerator join node is updated and not the cost model the whole Join Order Optimizer can start exhibiting undesired behavior.

---

The documentation for this class was generated from the following file:

• external/duckdb/duckdb.hpp