OmniSciDB  c0231cc57d
 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,
58  std::shared_ptr<const query_state::QueryState> query_state = nullptr)
59  : StorageIOFacility(executor, cat)
60  , executor_(executor)
61  , cat_(cat)
62  , query_state_(std::move(query_state))
63  , now_(0)
64  , queue_time_ms_(0) {
66  }
67 
68  RelAlgExecutor(Executor* executor,
70  const std::string& query_ra,
71  std::shared_ptr<const query_state::QueryState> query_state = nullptr)
72  : StorageIOFacility(executor, cat)
73  , executor_(executor)
74  , cat_(cat)
75  , query_dag_(RelAlgDagBuilder::buildDag(query_ra, cat, true))
76  , query_state_(std::move(query_state))
77  , now_(0)
78  , queue_time_ms_(0) {
80  }
81 
82  RelAlgExecutor(Executor* executor,
84  std::unique_ptr<RelAlgDag> query_dag,
85  std::shared_ptr<const query_state::QueryState> query_state = nullptr)
86  : StorageIOFacility(executor, cat)
87  , executor_(executor)
88  , cat_(cat)
89  , query_dag_(std::move(query_dag))
90  , query_state_(std::move(query_state))
91  , now_(0)
92  , queue_time_ms_(0) {
94  }
95 
96  size_t getOuterFragmentCount(const CompilationOptions& co, const ExecutionOptions& eo);
97 
99  const ExecutionOptions& eo,
100  const bool just_explain_plan,
101  RenderInfo* render_info);
102 
104  const CompilationOptions& co,
105  const ExecutionOptions& eo,
106  RenderInfo* render_info,
107  const int64_t queue_time_ms);
108 
110  const AggregatedColRange& agg_col_range,
111  const StringDictionaryGenerations& string_dictionary_generations,
112  const TableGenerations& table_generations);
113 
115  const CompilationOptions& co,
116  const ExecutionOptions& eo,
117  RenderInfo* render_info,
118  const int64_t queue_time_ms,
119  const bool with_existing_temp_tables = false);
120 
122  const std::pair<size_t, size_t> interval,
123  const CompilationOptions& co,
124  const ExecutionOptions& eo,
125  RenderInfo* render_info,
126  const int64_t queue_time_ms);
127 
129  const size_t step_idx,
130  const CompilationOptions& co,
131  const ExecutionOptions& eo,
132  RenderInfo* render_info);
133 
134  void addLeafResult(const unsigned id, const AggregatedResult& result) {
135  const auto it_ok = leaf_results_.emplace(id, result);
136  CHECK(it_ok.second);
137  }
138 
139  const RelAlgNode& getRootRelAlgNode() const {
140  CHECK(query_dag_);
141  return query_dag_->getRootNode();
142  }
143 
144  void prepareForeignTables();
145 
146  std::shared_ptr<const RelAlgNode> getRootRelAlgNodeShPtr() const {
147  CHECK(query_dag_);
148  return query_dag_->getRootNodeShPtr();
149  }
150 
151  std::pair<std::vector<unsigned>, std::unordered_map<unsigned, JoinQualsPerNestingLevel>>
152  getJoinInfo(const RelAlgNode* root_node);
153 
154  std::shared_ptr<RelAlgTranslator> getRelAlgTranslator(const RelAlgNode* root_node);
155 
156  const std::vector<std::shared_ptr<RexSubQuery>>& getSubqueries() const noexcept {
157  CHECK(query_dag_);
158  return query_dag_->getSubqueries();
159  };
160 
161  std::optional<RegisteredQueryHint> getParsedQueryHint(const RelAlgNode* node) {
162  return query_dag_ ? query_dag_->getQueryHint(node) : std::nullopt;
163  }
164 
166  std::unordered_map<size_t, std::unordered_map<unsigned, RegisteredQueryHint>>>
168  return query_dag_ ? std::make_optional(query_dag_->getQueryHints()) : std::nullopt;
169  }
170 
171  std::optional<RegisteredQueryHint> getGlobalQueryHint() {
172  return query_dag_ ? std::make_optional(query_dag_->getGlobalHints()) : std::nullopt;
173  }
174 
177  const Catalog_Namespace::SessionInfo& session);
178 
182 
183  Executor* getExecutor() const;
184 
185  void cleanupPostExecution();
186 
187  static std::string getErrorMessageFromCode(const int32_t error_code);
188 
190 
191  // used for testing
193  Executor* executor) {
194  CHECK(executor);
195  CHECK(root_node);
196  return RaExecutionSequence(root_node, executor);
197  }
198 
199  void prepareForeignTable();
200 
201  std::unordered_set<int> getPhysicalTableIds() const;
202 
204 
205  private:
207 
209  const ExecutionOptions& eo,
210  const bool just_explain_plan,
211  RenderInfo* render_info);
212 
213  void executeRelAlgStep(const RaExecutionSequence& seq,
214  const size_t step_idx,
215  const CompilationOptions&,
216  const ExecutionOptions&,
217  RenderInfo*,
218  const int64_t queue_time_ms);
219 
220  void executeUpdate(const RelAlgNode* node,
221  const CompilationOptions& co,
222  const ExecutionOptions& eo,
223  const int64_t queue_time_ms);
224 
225  void executeDelete(const RelAlgNode* node,
226  const CompilationOptions& co,
227  const ExecutionOptions& eo_in,
228  const int64_t queue_time_ms);
229 
231  const CompilationOptions&,
232  const ExecutionOptions&,
233  RenderInfo*,
234  const int64_t queue_time_ms);
235 
237  const CompilationOptions& co,
238  const ExecutionOptions& eo,
239  RenderInfo* render_info,
240  const int64_t queue_time_ms);
241 
243  const CompilationOptions&,
244  const ExecutionOptions&,
245  RenderInfo*,
246  const int64_t queue_time_ms,
247  const std::optional<size_t> previous_count);
248 
250  const CompilationOptions&,
251  const ExecutionOptions&,
252  const int64_t queue_time_ms);
253 
255  const CompilationOptions&,
256  const ExecutionOptions&,
257  RenderInfo*,
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 
268  ExecutionResult executeModify(const RelModify* modify, const ExecutionOptions& eo);
269 
271  const RaExecutionSequence&,
272  const CompilationOptions&,
273  const ExecutionOptions&,
274  RenderInfo*,
275  const int64_t queue_time_ms);
276 
277  // TODO(alex): just move max_groups_buffer_entry_guess to RelAlgExecutionUnit once
278  // we deprecate the plan-based executor paths and remove WorkUnit
279  struct WorkUnit {
281  const RelAlgNode* body;
283  std::unique_ptr<QueryRewriter> query_rewriter;
284  const std::vector<size_t> input_permutation;
285  const std::vector<size_t> left_deep_join_input_sizes;
286  };
287 
290  const RelAlgNode* body;
291  };
292 
294  std::list<Analyzer::OrderEntry>& order_entries,
295  const ExecutionOptions& eo);
296 
298  const WorkUnit& work_unit,
299  const std::vector<TargetMetaInfo>& targets_meta,
300  const bool is_agg,
301  const CompilationOptions& co_in,
302  const ExecutionOptions& eo_in,
303  RenderInfo*,
304  const int64_t queue_time_ms,
305  const std::optional<size_t> previous_count = std::nullopt);
306 
307  // Computes the window function results to be used by the query.
308  void computeWindow(const WorkUnit& work_unit,
309  const CompilationOptions& co,
310  const ExecutionOptions& eo,
311  ColumnCacheMap& column_cache_map,
312  const int64_t queue_time_ms);
313 
314  // Creates the window context for the given window function.
315  std::unique_ptr<WindowFunctionContext> createWindowFunctionContext(
316  const Analyzer::WindowFunction* window_func,
317  const std::shared_ptr<Analyzer::BinOper>& partition_key_cond,
318  std::unordered_map<QueryPlanHash, std::shared_ptr<HashJoin>>& partition_cache,
319  std::unordered_map<QueryPlanHash, size_t>& sorted_partition_key_ref_count_map,
320  const WorkUnit& work_unit,
321  const std::vector<InputTableInfo>& query_infos,
322  const CompilationOptions& co,
323  ColumnCacheMap& column_cache_map,
324  std::shared_ptr<RowSetMemoryOwner> row_set_mem_owner);
325 
326  size_t getNDVEstimation(const WorkUnit& work_unit,
327  const int64_t range,
328  const bool is_agg,
329  const CompilationOptions& co,
330  const ExecutionOptions& eo);
331 
332  std::optional<size_t> getFilteredCountAll(const WorkUnit& work_unit,
333  const bool is_agg,
334  const CompilationOptions& co,
335  const ExecutionOptions& eo);
336 
338  const std::vector<std::shared_ptr<Analyzer::Expr>>& filter_expressions,
339  const CompilationOptions& co,
340  const ExecutionOptions& eo);
341 
342  std::vector<PushedDownFilterInfo> selectFiltersToBePushedDown(
343  const RelAlgExecutor::WorkUnit& work_unit,
344  const CompilationOptions& co,
345  const ExecutionOptions& eo);
346 
347  bool isRowidLookup(const WorkUnit& work_unit);
348 
350  const std::vector<TargetMetaInfo>& targets_meta,
351  const bool is_agg,
352  const CompilationOptions& co,
353  const ExecutionOptions& eo,
354  RenderInfo* render_info,
355  const bool was_multifrag_kernel_launch,
356  const int64_t queue_time_ms);
357 
358  // Allows an out of memory error through if CPU retry is enabled. Otherwise, throws an
359  // appropriate exception corresponding to the query error code.
360  static void handlePersistentError(const int32_t error_code);
361 
362  WorkUnit createWorkUnit(const RelAlgNode*, const SortInfo&, const ExecutionOptions& eo);
363 
365  const SortInfo&,
366  const ExecutionOptions& eo);
367 
369  const SortInfo&,
370  const bool just_explain);
371 
373  const SortInfo&,
374  const ExecutionOptions& eo);
375 
377  const SortInfo&,
378  const bool just_explain);
379 
380  WorkUnit createJoinWorkUnit(const RelJoin*, const SortInfo&, const bool just_explain);
381 
383  const SortInfo&,
384  const ExecutionOptions& eo);
385 
387  const bool just_explain,
388  const bool is_gpu);
389 
390  void addTemporaryTable(const int table_id, const ResultSetPtr& result) {
391  CHECK_LT(size_t(0), result->colCount());
392  CHECK_LT(table_id, 0);
393  auto it_ok = temporary_tables_.emplace(table_id, result);
394  CHECK(it_ok.second);
395  }
396 
397  void eraseFromTemporaryTables(const int table_id) { temporary_tables_.erase(table_id); }
398 
399  void handleNop(RaExecutionDesc& ed);
400 
401  std::unordered_map<unsigned, JoinQualsPerNestingLevel>& getLeftDeepJoinTreesInfo() {
402  return left_deep_join_info_;
403  }
404 
406  const RelLeftDeepInnerJoin* join,
407  const std::vector<InputDescriptor>& input_descs,
408  const std::unordered_map<const RelAlgNode*, int>& input_to_nest_level,
409  const bool just_explain);
410 
411  // Transform the provided `join_condition` to conjunctive form, find composite
412  // key opportunities and finally translate it to an Analyzer expression.
413  std::list<std::shared_ptr<Analyzer::Expr>> makeJoinQuals(
414  const RexScalar* join_condition,
415  const std::vector<JoinType>& join_types,
416  const std::unordered_map<const RelAlgNode*, int>& input_to_nest_level,
417  const bool just_explain) const;
418 
419  void setHasStepForUnion(bool flag) { has_step_for_union_ = flag; }
420 
421  bool hasStepForUnion() const { return has_step_for_union_; }
422 
423  bool canUseResultsetCache(const ExecutionOptions& eo, RenderInfo* render_info) const;
424 
425  void setupCaching(const RelAlgNode* ra);
426 
427  Executor* executor_;
429  std::unique_ptr<RelAlgDag> query_dag_;
430  std::shared_ptr<const query_state::QueryState> query_state_;
432  time_t now_;
433  std::unordered_map<unsigned, JoinQualsPerNestingLevel> left_deep_join_info_;
434  std::vector<std::shared_ptr<Analyzer::Expr>> target_exprs_owned_; // TODO(alex): remove
435  std::unordered_map<unsigned, AggregatedResult> leaf_results_;
436  int64_t queue_time_ms_;
439 
440  std::unique_ptr<TransactionParameters> dml_transaction_parameters_;
441  std::optional<std::function<void()>> post_execution_callback_;
442 
444 };
445 
446 #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)
const std::vector< size_t > left_deep_join_input_sizes
std::string cat(Ts &&...args)
void addLeafResult(const unsigned id, const AggregatedResult &result)
AggregatedColRange computeColRangesCache()
class for a per-database catalog. also includes metadata for the current database and the current use...
Definition: Catalog.h:132
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_
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)
RelAlgExecutor(Executor *executor, Catalog_Namespace::Catalog &cat, const std::string &query_ra, std::shared_ptr< const query_state::QueryState > query_state=nullptr)
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::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
RelAlgExecutor(Executor *executor, Catalog_Namespace::Catalog &cat, std::unique_ptr< RelAlgDag > query_dag, std::shared_ptr< const query_state::QueryState > query_state=nullptr)
std::unordered_map< int, std::unordered_map< int, std::shared_ptr< const ColumnarResults >>> ColumnCacheMap
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:232
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
Catalog_Namespace::Catalog & cat_
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()
RelAlgExecutor(Executor *executor, Catalog_Namespace::Catalog &cat, std::shared_ptr< const query_state::QueryState > query_state=nullptr)
ExecutionResult executeRelAlgQuery(const CompilationOptions &co, const ExecutionOptions &eo, const bool just_explain_plan, RenderInfo *render_info)
#define CHECK(condition)
Definition: Logger.h:222
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< 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)
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)
std::unordered_set< int > getPhysicalTableIds() const
WorkUnit createSortInputWorkUnit(const RelSort *, std::list< Analyzer::OrderEntry > &order_entries, const ExecutionOptions &eo)