23#ifndef SQL_JOIN_OPTIMIZER_GRAPH_SIMPLIFICATION_H_
24#define SQL_JOIN_OPTIMIZER_GRAPH_SIMPLIFICATION_H_
283 (*cache)->index_in_pq = index;
288 std::vector<NeighborCache *, Mem_root_allocator<NeighborCache *>>,
289 CompareByBenefit, MarkNeighborCache>
A wrapper class which provides array bounds checking.
Definition: sql_array.h:46
Definition: graph_simplification.h:86
ALWAYS_INLINE bool EdgesAreNeighboring(size_t edge1_idx, size_t edge2_idx, ProposedSimplificationStep *step)
Definition: graph_simplification.cc:646
Bounds_checked_array< NeighborCache > m_cache
Definition: graph_simplification.h:271
Bounds_checked_array< EdgeCardinalities > m_edge_cardinalities
Definition: graph_simplification.h:217
void RecalculateNeighbors(size_t edge1_idx, size_t begin, size_t end)
Definition: graph_simplification.cc:595
SimplificationStep ConcretizeSimplificationStep(GraphSimplifier::ProposedSimplificationStep step)
Definition: graph_simplification.cc:760
JoinHypergraph * m_graph
Definition: graph_simplification.h:220
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:886
SimplificationResult DoSimplificationStep()
Definition: graph_simplification.cc:815
Mem_root_array< SimplificationStep > m_undone_steps
Definition: graph_simplification.h:202
void UpdatePQ(size_t edge_idx)
Definition: graph_simplification.cc:576
int num_steps_done() const
Definition: graph_simplification.h:133
Priority_queue< NeighborCache *, std::vector< NeighborCache *, Mem_root_allocator< NeighborCache * > >, CompareByBenefit, MarkNeighborCache > m_pq
Definition: graph_simplification.h:290
OnlineCycleFinder m_cycles
Definition: graph_simplification.h:225
Mem_root_array< SimplificationStep > m_done_steps
Definition: graph_simplification.h:196
GraphSimplifier(JoinHypergraph *graph, MEM_ROOT *mem_root)
Definition: graph_simplification.cc:552
Mem_root_allocator is a C++ STL memory allocator based on MEM_ROOT.
Definition: mem_root_allocator.h:67
A typesafe replacement for DYNAMIC_ARRAY.
Definition: mem_root_array.h:425
A fast online cycle finder, based on [Pea03].
Definition: online_cycle_finder.h:53
Implements a priority queue using a vector-based max-heap.
Definition: priority_queue.h:103
For each client connection we create a separate thread with THD serving as a thread/connection descri...
Definition: sql_lexer_thd.h:33
static MEM_ROOT mem_root
Definition: client_plugin.cc:109
void SimplifyQueryGraph(THD *thd, int subgraph_pair_limit, JoinHypergraph *graph, std::string *trace)
Definition of an undirected (join) hypergraph.
Header for compiler-dependent features.
#define ALWAYS_INLINE
Definition: my_compiler.h:109
Cursor end()
A past-the-end Cursor.
Definition: rules_table_service.cc:191
Definition: graph_simplification.h:276
bool operator()(const NeighborCache *a, const NeighborCache *b) const
Definition: graph_simplification.h:277
Definition: graph_simplification.h:213
double left
Definition: graph_simplification.h:214
double right
Definition: graph_simplification.h:215
Definition: graph_simplification.h:281
void operator()(size_t index, NeighborCache **cache)
Definition: graph_simplification.h:282
Definition: graph_simplification.h:253
int best_neighbor
Definition: graph_simplification.h:260
ProposedSimplificationStep best_step
Definition: graph_simplification.h:261
int index_in_pq
Definition: graph_simplification.h:269
Definition: graph_simplification.h:167
int before_edge_idx
Definition: graph_simplification.h:169
int after_edge_idx
Definition: graph_simplification.h:170
double benefit
Definition: graph_simplification.h:168
Definition: graph_simplification.h:179
int after_edge_idx
Definition: graph_simplification.h:181
int before_edge_idx
Definition: graph_simplification.h:180
hypergraph::Hyperedge new_edge
Definition: graph_simplification.h:185
hypergraph::Hyperedge old_edge
Definition: graph_simplification.h:184
A struct containing a join hypergraph of a single query block, encapsulating the constraints given by...
Definition: make_join_hypergraph.h:75
The MEM_ROOT is a simple arena, where allocations are carved out of larger blocks.
Definition: my_alloc.h:82
Definition: hypergraph.h:79