OmniSciDB  c1a53651b2
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
RelAlgExecutor.h
Go to the documentation of this file.
1 /*
2  * Copyright 2022 HEAVY.AI, Inc.
3  *
4  * Licensed under the Apache License, Version 2.0 (the "License");
5  * you may not use this file except in compliance with the License.
6  * You may obtain a copy of the License at
7  *
8  * http://www.apache.org/licenses/LICENSE-2.0
9  *
10  * Unless required by applicable law or agreed to in writing, software
11  * distributed under the License is distributed on an "AS IS" BASIS,
12  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13  * See the License for the specific language governing permissions and
14  * limitations under the License.
15  */
16 
17 #ifndef QUERYENGINE_RELALGEXECUTOR_H
18 #define QUERYENGINE_RELALGEXECUTOR_H
19 
22 #include "QueryEngine/Execute.h"
26 #include "QueryEngine/RelAlgDag.h"
29 #include "Shared/scope.h"
31 
32 #include <ctime>
33 #include <sstream>
34 
35 #include "StorageIOFacility.h"
36 
37 extern bool g_skip_intermediate_count;
38 
39 enum class MergeType { Union, Reduce };
40 
44  const unsigned node_id;
46 };
47 
48 namespace Fragmenter_Namespace {
49 class InsertDataLoader;
50 }
51 
53  public:
54  using TargetInfoList = std::vector<TargetInfo>;
55 
56  RelAlgExecutor(Executor* executor,
57  std::shared_ptr<const query_state::QueryState> query_state = nullptr)
58  : StorageIOFacility(executor)
59  , executor_(executor)
60  , query_state_(std::move(query_state))
61  , now_(0)
62  , queue_time_ms_(0) {
64  }
65 
66  RelAlgExecutor(Executor* executor,
67  const std::string& query_ra,
68  std::shared_ptr<const query_state::QueryState> query_state = nullptr)
69  : StorageIOFacility(executor)
70  , executor_(executor)
71  , query_dag_(RelAlgDagBuilder::buildDag(query_ra, true))
72  , query_state_(std::move(query_state))
73  , now_(0)
74  , queue_time_ms_(0) {
76  }
77 
78  RelAlgExecutor(Executor* executor,
79  std::unique_ptr<RelAlgDag> query_dag,
80  std::shared_ptr<const query_state::QueryState> query_state = nullptr)
81  : StorageIOFacility(executor)
82  , executor_(executor)
83  , query_dag_(std::move(query_dag))
84  , query_state_(std::move(query_state))
85  , now_(0)
86  , queue_time_ms_(0) {
88  }
89 
90  size_t getOuterFragmentCount(const CompilationOptions& co, const ExecutionOptions& eo);
91 
93  const ExecutionOptions& eo,
94  const bool just_explain_plan,
95  RenderInfo* render_info);
96 
98  const CompilationOptions& co,
99  const ExecutionOptions& eo,
100  RenderInfo* render_info,
101  const int64_t queue_time_ms);
102 
104  const AggregatedColRange& agg_col_range,
105  const StringDictionaryGenerations& string_dictionary_generations,
106  const TableGenerations& table_generations);
107 
109  const CompilationOptions& co,
110  const ExecutionOptions& eo,
111  RenderInfo* render_info,
112  const int64_t queue_time_ms,
113  const bool with_existing_temp_tables = false);
114 
116  const std::pair<size_t, size_t> interval,
117  const CompilationOptions& co,
118  const ExecutionOptions& eo,
119  RenderInfo* render_info,
120  const int64_t queue_time_ms);
121 
123  const size_t step_idx,
124  const CompilationOptions& co,
125  const ExecutionOptions& eo,
126  RenderInfo* render_info);
127 
128  void addLeafResult(const unsigned id, const AggregatedResult& result) {
129  const auto it_ok = leaf_results_.emplace(id, result);
130  CHECK(it_ok.second);
131  }
132 
133  std::unique_ptr<RelAlgDag> getOwnedRelAlgDag() {
134  CHECK(query_dag_);
135  return std::move(query_dag_);
136  }
137 
139  if (!query_dag_) {
140  query_dag_ = std::make_unique<RelAlgDag>();
141  }
142  return query_dag_.get();
143  }
144 
145  const RelAlgNode& getRootRelAlgNode() const {
146  CHECK(query_dag_);
147  return query_dag_->getRootNode();
148  }
149 
150  void prepareForeignTables();
151 
152  std::shared_ptr<const RelAlgNode> getRootRelAlgNodeShPtr() const {
153  CHECK(query_dag_);
154  return query_dag_->getRootNodeShPtr();
155  }
156 
157  std::pair<std::vector<unsigned>, std::unordered_map<unsigned, JoinQualsPerNestingLevel>>
158  getJoinInfo(const RelAlgNode* root_node);
159 
160  std::shared_ptr<RelAlgTranslator> getRelAlgTranslator(const RelAlgNode* root_node);
161 
162  const std::vector<std::shared_ptr<RexSubQuery>>& getSubqueries() const noexcept {
163  CHECK(query_dag_);
164  return query_dag_->getSubqueries();
165  };
166 
167  std::optional<RegisteredQueryHint> getParsedQueryHint(const RelAlgNode* node) {
168  return query_dag_ ? query_dag_->getQueryHint(node) : std::nullopt;
169  }
170 
172  std::unordered_map<size_t, std::unordered_map<unsigned, RegisteredQueryHint>>>
174  return query_dag_ ? std::make_optional(query_dag_->getQueryHints()) : std::nullopt;
175  }
176 
177  std::optional<RegisteredQueryHint> getGlobalQueryHint() {
178  return query_dag_ ? std::make_optional(query_dag_->getGlobalHints()) : std::nullopt;
179  }
180 
183  const Catalog_Namespace::SessionInfo& session);
184 
188 
189  Executor* getExecutor() const;
190 
191  void cleanupPostExecution();
192 
193  static std::string getErrorMessageFromCode(const int32_t error_code);
194 
196 
197  // used for testing
199  Executor* executor) {
200  CHECK(executor);
201  CHECK(root_node);
202  return RaExecutionSequence(root_node, executor);
203  }
204 
205  void prepareForeignTable();
206 
207  std::unordered_set<shared::TableKey> getPhysicalTableIds() const;
208 
210 
211  private:
213 
215  const ExecutionOptions& eo,
216  const bool just_explain_plan,
217  RenderInfo* render_info);
218 
219  void executeRelAlgStep(const RaExecutionSequence& seq,
220  const size_t step_idx,
221  const CompilationOptions&,
222  const ExecutionOptions&,
223  RenderInfo*,
224  const int64_t queue_time_ms);
225 
226  void executeUpdate(const RelAlgNode* node,
227  const CompilationOptions& co,
228  const ExecutionOptions& eo,
229  const int64_t queue_time_ms);
230 
231  void executeDelete(const RelAlgNode* node,
232  const CompilationOptions& co,
233  const ExecutionOptions& eo_in,
234  const int64_t queue_time_ms);
235 
237  const CompilationOptions&,
238  const ExecutionOptions&,
239  RenderInfo*,
240  const int64_t queue_time_ms);
241 
243  const CompilationOptions& co,
244  const ExecutionOptions& eo,
245  RenderInfo* render_info,
246  const int64_t queue_time_ms);
247 
249  const CompilationOptions&,
250  const ExecutionOptions&,
251  RenderInfo*,
252  const int64_t queue_time_ms,
253  const std::optional<size_t> previous_count);
254 
256  const CompilationOptions&,
257  const ExecutionOptions&,
258  const int64_t queue_time_ms);
259 
261  const CompilationOptions&,
262  const ExecutionOptions&,
263  RenderInfo*,
264  const int64_t queue_time_ms);
265 
267  const CompilationOptions&,
268  const ExecutionOptions&,
269  RenderInfo*,
270  const int64_t queue_time_ms);
271 
273 
274  ExecutionResult executeModify(const RelModify* modify, const ExecutionOptions& eo);
275 
277  const RaExecutionSequence&,
278  const CompilationOptions&,
279  const ExecutionOptions&,
280  RenderInfo*,
281  const int64_t queue_time_ms);
282 
283  // TODO(alex): just move max_groups_buffer_entry_guess to RelAlgExecutionUnit once
284  // we deprecate the plan-based executor paths and remove WorkUnit
285  struct WorkUnit {
287  const RelAlgNode* body;
289  std::unique_ptr<QueryRewriter> query_rewriter;
290  const std::vector<size_t> input_permutation;
291  const std::vector<size_t> left_deep_join_input_sizes;
292  };
293 
296  const RelAlgNode* body;
297  };
298 
300  std::list<Analyzer::OrderEntry>& order_entries,
301  const ExecutionOptions& eo);
302 
304  const WorkUnit& work_unit,
305  const std::vector<TargetMetaInfo>& targets_meta,
306  const bool is_agg,
307  const CompilationOptions& co_in,
308  const ExecutionOptions& eo_in,
309  RenderInfo*,
310  const int64_t queue_time_ms,
311  const std::optional<size_t> previous_count = std::nullopt);
312 
313  // Computes the window function results to be used by the query.
314  void computeWindow(const WorkUnit& work_unit,
315  const CompilationOptions& co,
316  const ExecutionOptions& eo,
317  ColumnCacheMap& column_cache_map,
318  const int64_t queue_time_ms);
319 
320  // Creates the window context for the given window function.
321  std::unique_ptr<WindowFunctionContext> createWindowFunctionContext(
322  const Analyzer::WindowFunction* window_func,
323  const std::shared_ptr<Analyzer::BinOper>& partition_key_cond,
324  std::unordered_map<QueryPlanHash, std::shared_ptr<HashJoin>>& partition_cache,
325  std::unordered_map<QueryPlanHash, size_t>& sorted_partition_key_ref_count_map,
326  const WorkUnit& work_unit,
327  const std::vector<InputTableInfo>& query_infos,
328  const CompilationOptions& co,
329  ColumnCacheMap& column_cache_map,
330  std::shared_ptr<RowSetMemoryOwner> row_set_mem_owner);
331 
332  size_t getNDVEstimation(const WorkUnit& work_unit,
333  const int64_t range,
334  const bool is_agg,
335  const CompilationOptions& co,
336  const ExecutionOptions& eo);
337 
338  std::optional<size_t> getFilteredCountAll(const WorkUnit& work_unit,
339  const bool is_agg,
340  const CompilationOptions& co,
341  const ExecutionOptions& eo);
342 
344  const std::vector<std::shared_ptr<Analyzer::Expr>>& filter_expressions,
345  const CompilationOptions& co,
346  const ExecutionOptions& eo);
347 
348  std::vector<PushedDownFilterInfo> selectFiltersToBePushedDown(
349  const RelAlgExecutor::WorkUnit& work_unit,
350  const CompilationOptions& co,
351  const ExecutionOptions& eo);
352 
353  bool isRowidLookup(const WorkUnit& work_unit);
354 
356  const std::vector<TargetMetaInfo>& targets_meta,
357  const bool is_agg,
358  const CompilationOptions& co,
359  const ExecutionOptions& eo,
360  RenderInfo* render_info,
361  const bool was_multifrag_kernel_launch,
362  const int64_t queue_time_ms);
363 
364  // Allows an out of memory error through if CPU retry is enabled. Otherwise, throws an
365  // appropriate exception corresponding to the query error code.
366  static void handlePersistentError(const int32_t error_code);
367 
368  WorkUnit createWorkUnit(const RelAlgNode*, const SortInfo&, const ExecutionOptions& eo);
369 
371  const SortInfo&,
372  const ExecutionOptions& eo);
373 
375  const SortInfo&,
376  const bool just_explain);
377 
379  const SortInfo&,
380  const ExecutionOptions& eo);
381 
383  const SortInfo&,
384  const bool just_explain);
385 
386  WorkUnit createJoinWorkUnit(const RelJoin*, const SortInfo&, const bool just_explain);
387 
389  const SortInfo&,
390  const ExecutionOptions& eo);
391 
393  const bool just_explain,
394  const bool is_gpu);
395 
396  void addTemporaryTable(const int table_id, const ResultSetPtr& result) {
397  CHECK_LT(size_t(0), result->colCount());
398  CHECK_LT(table_id, 0);
399  auto it_ok = temporary_tables_.emplace(table_id, result);
400  CHECK(it_ok.second);
401  }
402 
403  void eraseFromTemporaryTables(const int table_id) { temporary_tables_.erase(table_id); }
404 
405  void handleNop(RaExecutionDesc& ed);
406 
407  std::unordered_map<unsigned, JoinQualsPerNestingLevel>& getLeftDeepJoinTreesInfo() {
408  return left_deep_join_info_;
409  }
410 
412  const RelLeftDeepInnerJoin* join,
413  const std::vector<InputDescriptor>& input_descs,
414  const std::unordered_map<const RelAlgNode*, int>& input_to_nest_level,
415  const bool just_explain);
416 
417  // Transform the provided `join_condition` to conjunctive form, find composite
418  // key opportunities and finally translate it to an Analyzer expression.
419  std::list<std::shared_ptr<Analyzer::Expr>> makeJoinQuals(
420  const RexScalar* join_condition,
421  const std::vector<JoinType>& join_types,
422  const std::unordered_map<const RelAlgNode*, int>& input_to_nest_level,
423  const bool just_explain) const;
424 
425  void setHasStepForUnion(bool flag) { has_step_for_union_ = flag; }
426 
427  bool hasStepForUnion() const { return has_step_for_union_; }
428 
429  bool canUseResultsetCache(const ExecutionOptions& eo, RenderInfo* render_info) const;
430 
431  void setupCaching(const RelAlgNode* ra);
432 
433  Executor* executor_;
434  std::unique_ptr<RelAlgDag> query_dag_;
435  std::shared_ptr<const query_state::QueryState> query_state_;
437  time_t now_;
438  std::unordered_map<unsigned, JoinQualsPerNestingLevel> left_deep_join_info_;
439  std::vector<std::shared_ptr<Analyzer::Expr>> target_exprs_owned_; // TODO(alex): remove
440  std::unordered_map<unsigned, AggregatedResult> leaf_results_;
441  int64_t queue_time_ms_;
444 
445  std::unique_ptr<TransactionParameters> dml_transaction_parameters_;
446  std::optional<std::function<void()>> post_execution_callback_;
447 
449 };
450 
451 #endif // QUERYENGINE_RELALGEXECUTOR_H
bool is_agg(const Analyzer::Expr *expr)
int64_t queue_time_ms_
std::optional< std::function< void()> > post_execution_callback_
ExecutionResult executeAggregate(const RelAggregate *aggregate, const CompilationOptions &co, const ExecutionOptions &eo, RenderInfo *render_info, const int64_t queue_time_ms)
RelAlgExecutor(Executor *executor, std::unique_ptr< RelAlgDag > query_dag, std::shared_ptr< const query_state::QueryState > query_state=nullptr)
const std::vector< size_t > left_deep_join_input_sizes
void addLeafResult(const unsigned id, const AggregatedResult &result)
AggregatedColRange computeColRangesCache()
RelAlgExecutor(Executor *executor, const std::string &query_ra, std::shared_ptr< const query_state::QueryState > query_state=nullptr)
WorkUnit createProjectWorkUnit(const RelProject *, const SortInfo &, const ExecutionOptions &eo)
ExecutionResult executeRelAlgSeq(const RaExecutionSequence &seq, const CompilationOptions &co, const ExecutionOptions &eo, RenderInfo *render_info, const int64_t queue_time_ms, const bool with_existing_temp_tables=false)
TableFunctionWorkUnit createTableFunctionWorkUnit(const RelTableFunction *table_func, const bool just_explain, const bool is_gpu)
WorkUnit createAggregateWorkUnit(const RelAggregate *, const SortInfo &, const bool just_explain)
const RelAlgNode * body
bool g_skip_intermediate_count
Streaming Top N algorithm.
TableGenerations computeTableGenerations()
static SpeculativeTopNBlacklist speculative_topn_blacklist_
RelAlgExecutor(Executor *executor, std::shared_ptr< const query_state::QueryState > query_state=nullptr)
RelAlgExecutionUnit exe_unit
TemporaryTables temporary_tables_
ExecutionResult executeRelAlgQueryWithFilterPushDown(const RaExecutionSequence &seq, const CompilationOptions &co, const ExecutionOptions &eo, RenderInfo *render_info, const int64_t queue_time_ms)
void setupCaching(const RelAlgNode *ra)
FilterSelectivity getFilterSelectivity(const std::vector< std::shared_ptr< Analyzer::Expr >> &filter_expressions, const CompilationOptions &co, const ExecutionOptions &eo)
std::string join(T const &container, std::string const &delim)
std::unordered_map< unsigned, JoinQualsPerNestingLevel > & getLeftDeepJoinTreesInfo()
std::vector< PushedDownFilterInfo > selectFiltersToBePushedDown(const RelAlgExecutor::WorkUnit &work_unit, const CompilationOptions &co, const ExecutionOptions &eo)
std::optional< std::unordered_map< size_t, std::unordered_map< unsigned, RegisteredQueryHint > > > getParsedQueryHints()
ExecutionResult executeModify(const RelModify *modify, const ExecutionOptions &eo)
void addTemporaryTable(const int table_id, const ResultSetPtr &result)
std::unique_ptr< QueryRewriter > query_rewriter
std::unordered_map< unsigned, AggregatedResult > leaf_results_
std::vector< TargetInfo > TargetInfoList
std::vector< JoinCondition > JoinQualsPerNestingLevel
std::shared_ptr< ResultSet > ResultSetPtr
ExecutionResult executeLogicalValues(const RelLogicalValues *, const ExecutionOptions &)
std::optional< RegisteredQueryHint > getParsedQueryHint(const RelAlgNode *node)
ExecutionResult executeFilter(const RelFilter *, const CompilationOptions &, const ExecutionOptions &, RenderInfo *, const int64_t queue_time_ms)
const std::vector< std::shared_ptr< RexSubQuery > > & getSubqueries() const noexcept
QueryStepExecutionResult executeRelAlgQuerySingleStep(const RaExecutionSequence &seq, const size_t step_idx, const CompilationOptions &co, const ExecutionOptions &eo, RenderInfo *render_info)
bool hasStepForUnion() const
void handleNop(RaExecutionDesc &ed)
void computeWindow(const WorkUnit &work_unit, const CompilationOptions &co, const ExecutionOptions &eo, ColumnCacheMap &column_cache_map, const int64_t queue_time_ms)
std::shared_ptr< const RelAlgNode > getRootRelAlgNodeShPtr() const
std::unordered_map< int, const ResultSetPtr & > TemporaryTables
Definition: InputMetadata.h:31
WorkUnit createCompoundWorkUnit(const RelCompound *, const SortInfo &, const ExecutionOptions &eo)
WorkUnit createWorkUnit(const RelAlgNode *, const SortInfo &, const ExecutionOptions &eo)
RaExecutionSequence getRaExecutionSequence(const RelAlgNode *root_node, Executor *executor)
std::vector< std::shared_ptr< Analyzer::Expr > > target_exprs_owned_
std::unordered_set< shared::TableKey > getPhysicalTableIds() const
std::unique_ptr< WindowFunctionContext > createWindowFunctionContext(const Analyzer::WindowFunction *window_func, const std::shared_ptr< Analyzer::BinOper > &partition_key_cond, std::unordered_map< QueryPlanHash, std::shared_ptr< HashJoin >> &partition_cache, std::unordered_map< QueryPlanHash, size_t > &sorted_partition_key_ref_count_map, const WorkUnit &work_unit, const std::vector< InputTableInfo > &query_infos, const CompilationOptions &co, ColumnCacheMap &column_cache_map, std::shared_ptr< RowSetMemoryOwner > row_set_mem_owner)
size_t getOuterFragmentCount(const CompilationOptions &co, const ExecutionOptions &eo)
MergeType
void executeUpdate(const RelAlgNode *node, const CompilationOptions &co, const ExecutionOptions &eo, const int64_t queue_time_ms)
A container for relational algebra descriptors defining the execution order for a relational algebra ...
friend class PendingExecutionClosure
ExecutionResult handleOutOfMemoryRetry(const RelAlgExecutor::WorkUnit &work_unit, const std::vector< TargetMetaInfo > &targets_meta, const bool is_agg, const CompilationOptions &co, const ExecutionOptions &eo, RenderInfo *render_info, const bool was_multifrag_kernel_launch, const int64_t queue_time_ms)
void executePostExecutionCallback()
size_t getNDVEstimation(const WorkUnit &work_unit, const int64_t range, const bool is_agg, const CompilationOptions &co, const ExecutionOptions &eo)
ExecutionResult executeRelAlgSubSeq(const RaExecutionSequence &seq, const std::pair< size_t, size_t > interval, const CompilationOptions &co, const ExecutionOptions &eo, RenderInfo *render_info, const int64_t queue_time_ms)
const std::vector< size_t > input_permutation
WorkUnit createUnionWorkUnit(const RelLogicalUnion *, const SortInfo &, const ExecutionOptions &eo)
ExecutionResult executeRelAlgQueryNoRetry(const CompilationOptions &co, const ExecutionOptions &eo, const bool just_explain_plan, RenderInfo *render_info)
bool g_enable_smem_group_by true
void executeRelAlgStep(const RaExecutionSequence &seq, const size_t step_idx, const CompilationOptions &, const ExecutionOptions &, RenderInfo *, const int64_t queue_time_ms)
ExecutionResult executeSimpleInsert(const Analyzer::Query &insert_query, Fragmenter_Namespace::InsertDataLoader &inserter, const Catalog_Namespace::SessionInfo &session)
std::optional< size_t > getFilteredCountAll(const WorkUnit &work_unit, const bool is_agg, const CompilationOptions &co, const ExecutionOptions &eo)
Executor * getExecutor() const
std::optional< RegisteredQueryHint > getGlobalQueryHint()
ExecutionResult executeTableFunction(const RelTableFunction *, const CompilationOptions &, const ExecutionOptions &, const int64_t queue_time_ms)
std::unique_ptr< RelAlgDag > query_dag_
std::unordered_map< unsigned, JoinQualsPerNestingLevel > left_deep_join_info_
ExecutionResult executeWorkUnit(const WorkUnit &work_unit, const std::vector< TargetMetaInfo > &targets_meta, const bool is_agg, const CompilationOptions &co_in, const ExecutionOptions &eo_in, RenderInfo *, const int64_t queue_time_ms, const std::optional< size_t > previous_count=std::nullopt)
#define CHECK_LT(x, y)
Definition: Logger.h:303
WorkUnit createJoinWorkUnit(const RelJoin *, const SortInfo &, const bool just_explain)
ExecutionResult executeUnion(const RelLogicalUnion *, const RaExecutionSequence &, const CompilationOptions &, const ExecutionOptions &, RenderInfo *, const int64_t queue_time_ms)
std::shared_ptr< const query_state::QueryState > query_state_
Speculative top N algorithm.
const MergeType merge_type
std::unordered_map< shared::TableKey, std::unordered_map< int, std::shared_ptr< const ColumnarResults >>> ColumnCacheMap
const RelAlgNode & getRootRelAlgNode() const
size_t QueryPlanHash
void eraseFromTemporaryTables(const int table_id)
bool canUseResultsetCache(const ExecutionOptions &eo, RenderInfo *render_info) const
ExecutionResult executeSort(const RelSort *, const CompilationOptions &, const ExecutionOptions &, RenderInfo *, const int64_t queue_time_ms)
bool isRowidLookup(const WorkUnit &work_unit)
ExecutionResult executeProject(const RelProject *, const CompilationOptions &, const ExecutionOptions &, RenderInfo *, const int64_t queue_time_ms, const std::optional< size_t > previous_count)
TableFunctionExecutionUnit exe_unit
static void handlePersistentError(const int32_t error_code)
const size_t max_groups_buffer_entry_guess
StringDictionaryGenerations computeStringDictionaryGenerations()
ExecutionResult executeRelAlgQuery(const CompilationOptions &co, const ExecutionOptions &eo, const bool just_explain_plan, RenderInfo *render_info)
#define CHECK(condition)
Definition: Logger.h:291
ExecutionResult executeCompound(const RelCompound *, const CompilationOptions &, const ExecutionOptions &, RenderInfo *, const int64_t queue_time_ms)
static std::string getErrorMessageFromCode(const int32_t error_code)
void cleanupPostExecution()
void initializeParallelismHints()
std::list< std::shared_ptr< Analyzer::Expr > > makeJoinQuals(const RexScalar *join_condition, const std::vector< JoinType > &join_types, const std::unordered_map< const RelAlgNode *, int > &input_to_nest_level, const bool just_explain) const
std::unique_ptr< RelAlgDag > getOwnedRelAlgDag()
std::unique_ptr< TransactionParameters > dml_transaction_parameters_
std::pair< std::vector< unsigned >, std::unordered_map< unsigned, JoinQualsPerNestingLevel > > getJoinInfo(const RelAlgNode *root_node)
void executeDelete(const RelAlgNode *node, const CompilationOptions &co, const ExecutionOptions &eo_in, const int64_t queue_time_ms)
ExecutionResult result
std::shared_ptr< RelAlgTranslator > getRelAlgTranslator(const RelAlgNode *root_node)
RelAlgDag * getRelAlgDag()
Executor * executor_
void prepareForSystemTableExecution(const CompilationOptions &co) const
void prepareForeignTable()
WorkUnit createFilterWorkUnit(const RelFilter *, const SortInfo &, const bool just_explain)
JoinQualsPerNestingLevel translateLeftDeepJoinFilter(const RelLeftDeepInnerJoin *join, const std::vector< InputDescriptor > &input_descs, const std::unordered_map< const RelAlgNode *, int > &input_to_nest_level, const bool just_explain)
void setHasStepForUnion(bool flag)
void prepareLeafExecution(const AggregatedColRange &agg_col_range, const StringDictionaryGenerations &string_dictionary_generations, const TableGenerations &table_generations)
WorkUnit createSortInputWorkUnit(const RelSort *, std::list< Analyzer::OrderEntry > &order_entries, const ExecutionOptions &eo)