PEall Struct Reference

Computes the join order by enumerating all join orders, including Cartesian products. More...

Inheritance diagram for PEall:

Collaboration diagram for PEall:

Public Types
using	base_type = PlanEnumeratorCRTP< PEall >
using	Subproblem = QueryGraph::Subproblem

Public Member Functions
template<typename PlanTable >
void	operator() (enumerate_tag, PlanTable &PT, const QueryGraph &G, const CostFunction &CF) const
template<typename PlanTable >
void	operator() (const QueryGraph &G, const CostFunction &CF, PlanTable &PT) const
	Enumerate subplans and fill plan table.

Detailed Description

Computes the join order by enumerating all join orders, including Cartesian products.

Definition at line 33 of file PlanEnumerator.cpp.

Member Typedef Documentation

base_type

using PEall::base_type = PlanEnumeratorCRTP<PEall>

Definition at line 35 of file PlanEnumerator.cpp.

Subproblem

using m::pe::PlanEnumerator::Subproblem = QueryGraph::Subproblem

inherited

Definition at line 28 of file PlanEnumerator.hpp.

Member Function Documentation

operator()() [1/2]

template<typename PlanTable >

void m::pe::PlanEnumerator::operator() ( const QueryGraph &  G, const CostFunction &  CF, PlanTable &  PT  ) const

inlineinherited

Enumerate subplans and fill plan table.

Definition at line 35 of file PlanEnumerator.hpp.

operator()() [2/2]

template<typename PlanTable >

void PEall::operator() ( enumerate_tag  , PlanTable &  PT, const QueryGraph &  G, const CostFunction &  CF  ) const

inline

Definition at line 39 of file PlanEnumerator.cpp.

References m::SmallBitset::capacity(), m::Database::cardinality_estimator(), m::Catalog::Get(), m::Catalog::get_database_in_use(), m::least_subset(), M_insist, m::next_subset(), m::SmallBitset::Singleton(), m::SmallBitset::size(), and m::QueryGraph::sources().

---

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

• src/IR/PlanEnumerator.cpp