![]() |
mutable
A Database System for Research and Fast Prototyping
|
#include <HeuristicSearchPlanEnumerator.hpp>
Public Types | |
using | state_type = State |
Public Member Functions | |
bottomup_lookahead_cheapest (PlanTable &, const QueryGraph &, const AdjacencyMatrix &, const CostFunction &, const CardinalityEstimator &) | |
double | operator() (const state_type &state, PlanTable &PT, const QueryGraph &G, const AdjacencyMatrix &M, const CostFunction &CF, const CardinalityEstimator &CE) const |
Definition at line 1896 of file HeuristicSearchPlanEnumerator.hpp.
using m::pe::hs::heuristics::bottomup_lookahead_cheapest< PlanTable, State >::state_type = State |
Definition at line 1898 of file HeuristicSearchPlanEnumerator.hpp.
|
inline |
Definition at line 1900 of file HeuristicSearchPlanEnumerator.hpp.
|
inline |
XXX: Sum of different units: cost and cardinality
Definition at line 1904 of file HeuristicSearchPlanEnumerator.hpp.
References m::CostFunction::calculate_join_cost(), m::CardinalityEstimator::estimate_join(), M_insist, m::AdjacencyMatrix::neighbors(), and m::CardinalityEstimator::predict_cardinality().