25 template<
typename PlanTable>
28 template<
typename PlanTable>
A partial plan is a set of (potentially incomplete) pairwise disjoint plans.
void for_each_complete_partial_plan(const PlanTable &PT, callback_type callback)
Given a PlanTable with a final plan, enumerate all complete partial plans of this final plan and invo...
void write_partial_plans_JSON(std::ostream &out, const QueryGraph &G, const PlanTable &PT, std::function< void(callback_type)> for_each_partial_plan)
std::vector< Subproblem > partial_plan_type
std::function< void(const partial_plan_type &)> callback_type
The query graph represents all data sources and joins in a graph structure.
Implements a small and efficient set over integers in the range of 0 to 63 (including).