m::pe::hs Namespace Reference

‍heuristic search namespace

More...

Namespaces
namespace	config
namespace	expansions
	‍heuristic search state expansions namespace
namespace	heuristics
namespace	search_states
	‍heuristic search states namespace

Data Structures
struct	HeuristicSearch
	Computes the join order using heuristic search. More...

Typedefs
using	Subproblem = SmallBitset
using	binary_plan_type = std::vector< std::pair< Subproblem, Subproblem > >

Functions
template<typename PlanTable , typename State >
double	goo_path_completion (const State &state, PlanTable &PT, const QueryGraph &G, const AdjacencyMatrix &M, const CardinalityEstimator &CE, const CostFunction &CF, binary_plan_type &plan)
template<typename PlanTable , typename State , typename Expand , typename Search , template< typename, typename, typename > typename Heuristic, ai::SearchConfigConcept StaticConfig>
bool	heuristic_search (PlanTable &PT, const QueryGraph &G, const AdjacencyMatrix &M, const CostFunction &CF, const CardinalityEstimator &CE, Search &S, const ai::SearchConfiguration< StaticConfig > &config)
template<typename PlanTable , typename State , typename Expand , typename SearchAlgorithm , template< typename, typename, typename > typename Heuristic, ai::SearchConfigConcept StaticConfig>
bool	heuristic_search (PlanTable &PT, const QueryGraph &G, const AdjacencyMatrix &M, const CostFunction &CF, const CardinalityEstimator &CE, SearchAlgorithm &S, const ai::SearchConfiguration< StaticConfig > &config)

Detailed Description

‍heuristic search namespace

Typedef Documentation

binary_plan_type

using m::pe::hs::binary_plan_type = typedef std::vector<std::pair<Subproblem, Subproblem> >

Definition at line 2180 of file HeuristicSearchPlanEnumerator.hpp.

Subproblem

using m::pe::hs::Subproblem = typedef SmallBitset

Definition at line 40 of file HeuristicSearchPlanEnumerator.hpp.

Function Documentation

goo_path_completion()

template<typename PlanTable , typename State >

double m::pe::hs::goo_path_completion	(	const State &	state,
		PlanTable &	PT,
		const QueryGraph &	G,
		const AdjacencyMatrix &	M,
		const CardinalityEstimator &	CE,
		const CostFunction &	CF,
		binary_plan_type &	plan
	)

Definition at line 123 of file HeuristicSearchPlanEnumerator.cpp.

References m::SmallBitset::All(), m::CostFunction::calculate_join_cost(), m::pe::GOO::for_each_join(), m::AdjacencyMatrix::neighbors(), and m::QueryGraph::num_sources().

heuristic_search() [1/2]

template<typename PlanTable , typename State , typename Expand , typename Search , template< typename, typename, typename > typename Heuristic, ai::SearchConfigConcept StaticConfig>

bool m::pe::hs::heuristic_search	(	PlanTable &	PT,
		const QueryGraph &	G,
		const AdjacencyMatrix &	M,
		const CostFunction &	CF,
		const CardinalityEstimator &	CE,
		Search &	S,
		const ai::SearchConfiguration< StaticConfig > &	config
	)

heuristic_search() [2/2]

template<typename PlanTable , typename State , typename Expand , typename SearchAlgorithm , template< typename, typename, typename > typename Heuristic, ai::SearchConfigConcept StaticConfig>

bool m::pe::hs::heuristic_search	(	PlanTable &	PT,
		const QueryGraph &	G,
		const AdjacencyMatrix &	M,
		const CostFunction &	CF,
		const CardinalityEstimator &	CE,
		SearchAlgorithm &	S,
		const ai::SearchConfiguration< StaticConfig > &	config
	)

< map from State to StateInfo

Compute the f-value of an entry in the state manager.

Definition at line 179 of file HeuristicSearchPlanEnumerator.cpp.

References m::SmallBitset::All(), m::pe::GOO::compute_plan(), m::pe::TDGOO::for_each_join(), m::Options::Get(), m::ai::SearchConfiguration< StaticConfig >::initial_plan, M_insist, m::AdjacencyMatrix::neighbors(), m::QueryGraph::num_sources(), m::Options::quiet, m::Options::statistics, m::ai::SearchConfiguration< StaticConfig >::upper_bound, and m::ai::SearchConfiguration< StaticConfig >::weighting_factor.