24#ifndef SQL_JOIN_OPTIMIZER_GRAPH_SIMPLIFICATION_H_
25#define SQL_JOIN_OPTIMIZER_GRAPH_SIMPLIFICATION_H_
134 assert(
m_done_steps.size() <
size_t{std::numeric_limits<int>::max()});
140 assert(
m_undone_steps.size() <
size_t{std::numeric_limits<int>::max()});
293 (*cache)->index_in_pq = index;
298 std::vector<NeighborCache *, Mem_root_allocator<NeighborCache *>>,
299 CompareByBenefit, MarkNeighborCache>
A wrapper class which provides array bounds checking.
Definition: sql_array.h:47
Definition: graph_simplification.h:86
ALWAYS_INLINE bool EdgesAreNeighboring(size_t edge1_idx, size_t edge2_idx, ProposedSimplificationStep *step)
Definition: graph_simplification.cc:664
Bounds_checked_array< NeighborCache > m_cache
Definition: graph_simplification.h:281
Bounds_checked_array< EdgeCardinalities > m_edge_cardinalities
Definition: graph_simplification.h:227
THD * m_thd
Definition: graph_simplification.h:203
void RecalculateNeighbors(size_t edge1_idx, size_t begin, size_t end)
Definition: graph_simplification.cc:613
GraphSimplifier(THD *thd, JoinHypergraph *graph)
Definition: graph_simplification.cc:568
SimplificationStep ConcretizeSimplificationStep(GraphSimplifier::ProposedSimplificationStep step)
Definition: graph_simplification.cc:791
JoinHypergraph * m_graph
Definition: graph_simplification.h:230
SimplificationResult
Definition: graph_simplification.h:93
@ APPLIED_REDO_STEP
Definition: graph_simplification.h:111
@ NO_SIMPLIFICATION_POSSIBLE
Definition: graph_simplification.h:95
@ APPLIED_SIMPLIFICATION
Definition: graph_simplification.h:99
@ APPLIED_NOOP
Definition: graph_simplification.h:106
void UndoSimplificationStep()
Definition: graph_simplification.cc:921
SimplificationResult DoSimplificationStep()
Definition: graph_simplification.cc:847
Mem_root_array< SimplificationStep > m_undone_steps
Definition: graph_simplification.h:212
void UpdatePQ(size_t edge_idx)
Definition: graph_simplification.cc:593
int num_steps_done() const
Definition: graph_simplification.h:133
int num_steps_undone() const
Definition: graph_simplification.h:139
Priority_queue< NeighborCache *, std::vector< NeighborCache *, Mem_root_allocator< NeighborCache * > >, CompareByBenefit, MarkNeighborCache > m_pq
Definition: graph_simplification.h:300
OnlineCycleFinder m_cycles
Definition: graph_simplification.h:235
Mem_root_array< SimplificationStep > m_done_steps
Definition: graph_simplification.h:206
A typesafe replacement for DYNAMIC_ARRAY.
Definition: mem_root_array.h:426
A fast online cycle finder, based on [Pea03].
Definition: online_cycle_finder.h:54
Implements a priority queue using a vector-based max-heap.
Definition: priority_queue.h:104
For each client connection we create a separate thread with THD serving as a thread/connection descri...
Definition: sql_lexer_thd.h:36
void SimplifyQueryGraph(THD *thd, int subgraph_pair_limit, JoinHypergraph *graph, GraphSimplifier *simplifier)
Repeatedly apply simplifications (in the order of most to least safe) to the given hypergraph,...
Definition: graph_simplification.cc:965
void SetNumberOfSimplifications(int num_simplifications, GraphSimplifier *simplifier)
Definition: graph_simplification.cc:934
Definition of an undirected (join) hypergraph.
Header for compiler-dependent features.
#define ALWAYS_INLINE
Definition: my_compiler.h:99
const char * begin(const char *const c)
Definition: base64.h:44
Cursor end()
A past-the-end Cursor.
Definition: rules_table_service.cc:192
Definition: graph_simplification.h:286
bool operator()(const NeighborCache *a, const NeighborCache *b) const
Definition: graph_simplification.h:287
Definition: graph_simplification.h:223
double left
Definition: graph_simplification.h:224
double right
Definition: graph_simplification.h:225
Definition: graph_simplification.h:291
void operator()(size_t index, NeighborCache **cache)
Definition: graph_simplification.h:292
Definition: graph_simplification.h:263
int best_neighbor
Definition: graph_simplification.h:270
ProposedSimplificationStep best_step
Definition: graph_simplification.h:271
int index_in_pq
Definition: graph_simplification.h:279
Definition: graph_simplification.h:176
int before_edge_idx
Definition: graph_simplification.h:178
int after_edge_idx
Definition: graph_simplification.h:179
double benefit
Definition: graph_simplification.h:177
Definition: graph_simplification.h:188
int after_edge_idx
Definition: graph_simplification.h:190
int before_edge_idx
Definition: graph_simplification.h:189
hypergraph::Hyperedge new_edge
Definition: graph_simplification.h:194
hypergraph::Hyperedge old_edge
Definition: graph_simplification.h:193
A struct containing a join hypergraph of a single query block, encapsulating the constraints given by...
Definition: make_join_hypergraph.h:88
Definition: hypergraph.h:81