![]() |
mutable
A Database System for Research and Fast Prototyping
|
#include <CostFunction.hpp>
Public Types | |
using | Subproblem = SmallBitset |
Public Member Functions | |
CostFunction () | |
virtual | ~CostFunction ()=default |
template<typename PlanTable > | |
double | calculate_filter_cost (const QueryGraph &G, const PlanTable &PT, const CardinalityEstimator &CE, Subproblem sub, const cnf::CNF &condition) const |
Returns the total cost of performing a Filter operation. | |
template<typename PlanTable > | |
double | calculate_join_cost (const QueryGraph &G, const PlanTable &PT, const CardinalityEstimator &CE, Subproblem left, Subproblem right, const cnf::CNF &condition) const |
Returns the total cost of performing a Join operation. | |
template<typename PlanTable > | |
double | calculate_grouping_cost (const QueryGraph &G, const PlanTable &PT, const CardinalityEstimator &CE, Subproblem sub, const std::vector< const ast::Expr * > &group_by) const |
Returns the total cost of performing a Grouping operation. | |
Definition at line 37 of file CostFunction.hpp.
Definition at line 41 of file CostFunction.hpp.
|
inline |
Definition at line 44 of file CostFunction.hpp.
|
virtualdefault |
|
inline |
Returns the total cost of performing a Filter operation.
Definition at line 53 of file CostFunction.hpp.
|
inline |
Returns the total cost of performing a Grouping operation.
Definition at line 70 of file CostFunction.hpp.
|
inline |
Returns the total cost of performing a Join operation.
Definition at line 61 of file CostFunction.hpp.
Referenced by m::pe::hs::goo_path_completion(), m::pe::hs::heuristics::bottomup_lookahead_cheapest< PlanTable, State >::operator()(), m::pe::hs::heuristics::GOO< PlanTable, State, BottomUp >::operator()(), m::pe::hs::expansions::BottomUpComplete::operator()(), and m::PlanTableBase< Actual >::update().