The QueryGraph contains edges between relations and allows edges to be created/queried. More...

Collaboration diagram for duckdb::QueryGraphEdges:

[legend]

Classes
struct	QueryEdge
	Contains a node with info about neighboring relations and child edge infos. More...

Public Member Functions
string	ToString () const

void	Print ()

const vector< reference< NeighborInfo > >	GetConnections (JoinRelationSet &node, JoinRelationSet &other) const
	Returns a connection if there is an edge that connects these two sets, or nullptr otherwise.

const vector< idx_t >	GetNeighbors (JoinRelationSet &node, unordered_set< idx_t > &exclusion_set) const

void	EnumerateNeighbors (JoinRelationSet &node, const std::function< bool(NeighborInfo &)> &callback) const
	Enumerate all neighbors of a given JoinRelationSet node.

void	CreateEdge (JoinRelationSet &left, JoinRelationSet &right, optional_ptr< FilterInfo > info)
	Create an edge in the edge_set.

Private Member Functions
optional_ptr< QueryEdge >	GetQueryEdge (JoinRelationSet &left)
	Get the QueryEdge of a specific node.

void	EnumerateNeighborsDFS (JoinRelationSet &node, reference< QueryEdge > info, idx_t index, const std::function< bool(NeighborInfo &)> &callback) const

Private Attributes
QueryEdge	root

Detailed Description

The QueryGraph contains edges between relations and allows edges to be created/queried.

Member Function Documentation

◆ GetNeighbors()

const vector< idx_t > duckdb::QueryGraphEdges::GetNeighbors	(	JoinRelationSet &	node,
		unordered_set< idx_t > &	exclusion_set
	)		const

Enumerate the neighbors of a specific node that do not belong to any of the exclusion_set. Note that if a neighbor has multiple nodes, this function will return the lowest entry in that set.

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

external/duckdb/duckdb.hpp

Classes

Public Member Functions

Private Member Functions

Private Attributes

Detailed Description

Member Function Documentation

◆ GetNeighbors()