/** * Copyright (c) 2021 OceanBase * OceanBase CE is licensed under Mulan PubL v2. * You can use this software according to the terms and conditions of the Mulan PubL v2. * You may obtain a copy of Mulan PubL v2 at: * http://license.coscl.org.cn/MulanPubL-2.0 * THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND, * EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT, * MERCHANTABILITY OR FIT FOR A PARTICULAR PURPOSE. * See the Mulan PubL v2 for more details. */ #ifndef OCEANBASE_SQL_OB_LOG_PLAN_H #define OCEANBASE_SQL_OB_LOG_PLAN_H #include "lib/allocator/page_arena.h" #include "lib/string/ob_string.h" #include "sql/ob_sql_context.h" #include "sql/resolver/dml/ob_dml_stmt.h" #include "sql/resolver/dml/ob_del_upd_stmt.h" #include "sql/resolver/dml/ob_update_stmt.h" #include "sql/resolver/dml/ob_delete_stmt.h" #include "sql/resolver/dml/ob_insert_stmt.h" #include "sql/resolver/dml/ob_insert_all_stmt.h" #include "sql/resolver/ddl/ob_explain_stmt.h" #include "sql/resolver/expr/ob_raw_expr_util.h" #include "sql/optimizer/ob_optimizer_context.h" #include "sql/optimizer/ob_opt_est_utils.h" #include "sql/optimizer/ob_opt_selectivity.h" #include "sql/optimizer/ob_log_operator_factory.h" #include "sql/optimizer/ob_table_partition_info.h" #include "sql/optimizer/ob_optimizer.h" #include "share/client_feedback/ob_feedback_int_struct.h" #include "sql/optimizer/ob_logical_operator.h" #include "sql/optimizer/ob_log_optimizer_stats_gathering.h" #include "sql/ob_sql_define.h" namespace test { class ObLogPlanTest_ob_explain_test_Test; } namespace oceanbase { namespace share { class ObServerLocality; namespace schema { class ObSchemaGetterGuard; } } namespace sql { class ObLogicalOperator; class ObLogTableScan; class ObLogDelUpd; class AllocExchContext; class ObJoinOrder; class AccessPath; class Path; class JoinPath; class SubQueryPath; class FunctionTablePath; class JsonTablePath; class TempTablePath; class CteTablePath; class ObJoinOrder; class ObOptimizerContext; class ObLogJoin; struct JoinInfo; struct ConflictDetector; struct FunctionTableDependInfo; class ObLogSort; class ObLogJoinFilter; class ObLogSubPlanFilter; struct ObAllocExprContext; class ObLogTempTableInsert; class ObLogTempTableAccess; class ObLogTempTableTransformation; class ObDelUpdStmt; class ObExchangeInfo; class ObDmlTableInfo; struct IndexDMLInfo; struct FunctionTableDependInfo { TO_STRING_KV( K_(depend_table_set), K_(table_idx) ); ObSqlBitSet<> depend_table_set_; //function table expr所依赖的表 int64_t table_idx_; //function table的bit index }; typedef struct FunctionTableDependInfo JsonTableDependInfo; #undef KYES_DEF struct SubPlanInfo { SubPlanInfo() : init_expr_(NULL), subplan_(NULL), init_plan_(false) {} SubPlanInfo(ObQueryRefRawExpr *expr, ObLogPlan *plan, bool init_) : init_expr_(expr), subplan_(plan), init_plan_(init_) {} virtual ~SubPlanInfo() {} void set_subplan(ObLogPlan *plan) { subplan_ = plan; } ObQueryRefRawExpr *init_expr_; ObLogPlan *subplan_; bool init_plan_; TO_STRING_KV(K_(init_expr), K_(subplan), K_(init_plan)); }; struct ObDistinctAggrBatch { // first: the origin aggr expr // second: the mocked aggr expr for three stage push down ObSEArray, 2, ModulePageAllocator, true> mocked_aggrs_; // first: the origin distint param expr // second: the mocked pseudo expr for the distinct param. ObSEArray, 1, ModulePageAllocator, true> mocked_params_; TO_STRING_KV(K(mocked_aggrs_), K(mocked_params_)); }; typedef common::ObSEArray JoinOrderArray; /** * Base class for logical plan for all DML/select statements */ class ObLogPlan { public: static const int64_t RELORDER_HASHBUCKET_SIZE = 256; static const int64_t JOINPATH_SET_HASHBUCKET_SIZE = 3000; friend class ::test::ObLogPlanTest_ob_explain_test_Test; typedef common::ObList ObAddrList; static int select_replicas(ObExecContext &exec_ctx, const common::ObIArray &tbl_loc_list, const common::ObAddr &local_server, common::ObIArray &phy_tbl_loc_info_list); static int select_replicas(ObExecContext &exec_ctx, bool is_weak, const common::ObAddr &local_server, common::ObIArray &phy_tbl_loc_info_list); public: ObLogPlan(ObOptimizerContext &ctx, const ObDMLStmt *stmt); virtual ~ObLogPlan(); void destory(); /* return the sql text for the plan */ inline common::ObString &get_sql_text() {return sql_text_;} // @brief Get the corresponding stmt inline virtual const ObDMLStmt *get_stmt() const { return stmt_; } inline int get_stmt_type(stmt::StmtType &stmt_type) const { int ret = common::OB_NOT_INIT; if (NULL != get_stmt()) { stmt_type = get_stmt()->get_stmt_type(); ret = common::OB_SUCCESS; } return ret; } double get_optimization_cost(); void set_query_ref(ObQueryRefRawExpr *query_ref) { query_ref_ = query_ref; } /* * plan root will be set after we generate raw plan (see function generate_raw_plan()) * do not involve this function during generate_row_plan() */ inline ObLogicalOperator *get_plan_root() const { return root_; } inline void set_plan_root(ObLogicalOperator *root) { root_ = root; } void set_max_op_id(uint64_t max_op_id) { max_op_id_ = max_op_id; } uint64_t get_max_op_id() const { return max_op_id_; } int make_candidate_plans(ObLogicalOperator *top); /** * @brief Generate the plan tree * @param void * @retval OB_SUCCESS execute success * @retval OB_OPTIMIZE_GEN_PLAN_FALIED failed to generate the logical plan * * The function will be invoked by all DML/select statements and will handle * the 'common' part of those statements, including joins, order-by, limit and * etc. */ virtual int generate_plan_tree(); /** * Generate the "explain plan" string */ int64_t to_string(char *buf, const int64_t buf_len, ExplainType type = EXPLAIN_TRADITIONAL, const ObExplainDisplayOpt &opt = ObExplainDisplayOpt()) const; /** * Get optimizer context */ ObOptimizerContext &get_optimizer_context() const { return optimizer_context_; } ObFdItemFactory &get_fd_item_factory() const { return optimizer_context_.get_fd_item_factory(); } int generate_raw_plan(); virtual int generate_plan(); int do_post_plan_processing(); int do_post_traverse_processing(); int add_explain_note(); int add_parallel_explain_note(); int adjust_final_plan_info(ObLogicalOperator *&op); int update_re_est_cost(ObLogicalOperator *op); int collect_table_location(ObLogicalOperator *op); int collect_location_related_info(ObLogicalOperator &op); int build_location_related_tablet_ids(); int gen_das_table_location_info(ObLogTableScan *table_scan, ObTablePartitionInfo *&table_partition_info); int check_das_dppr_filter_exprs(const ObIArray &input_filters, bool &has_dppr_filters); int set_duplicated_table_location(ObLogicalOperator *op, int64_t dup_table_pos); /** * Get allocator used in sql compilation * * The entire optimization process should use only this allocator. */ common::ObIAllocator &get_allocator() const { return allocator_; } /** * Get the logical operator allocator */ virtual ObLogOperatorFactory &get_log_op_factory() { return log_op_factory_; } /** * List all needed plan traversals */ template int plan_traverse_loop(TS ...args); const common::ObIArray> & get_group_replaced_exprs() const { return group_replaced_exprs_; } int set_group_replaced_exprs(common::ObIArray > &exprs) { return group_replaced_exprs_.assign(exprs); } common::ObIArray &get_multi_stmt_rowkey_pos() { return multi_stmt_rowkey_pos_; } const common::ObIArray &get_multi_stmt_rowkey_pos() const { return multi_stmt_rowkey_pos_; } int add_global_table_partition_info(ObTablePartitionInfo *addr_table_partition_info); int get_global_table_partition_info(common::ObIArray &info) const { return append(info, optimizer_context_.get_table_partition_info()); } int remove_duplicate_constraint(ObLocationConstraintContext &location_constraint, ObSqlCtx &sql_ctx) const; int remove_duplicate_base_table_constraint(ObLocationConstraintContext &location_constraint) const; int remove_duplicate_pwj_constraint(ObIArray &pwj_constraints) const; int replace_pwj_constraints(ObIArray &constraints, const int64_t from, const int64_t to) const; int sort_pwj_constraint(ObLocationConstraintContext &location_constraint) const; int resolve_dup_tab_constraint(ObLocationConstraintContext &location_constraint) const; int get_from_table_items(const ObIArray &from_items, ObIArray &table_items); int get_current_semi_infos(const ObIArray &semi_infos, const ObIArray &table_items, ObIArray ¤t_semi_infos); int get_table_ids(TableItem *table_item, ObRelIds& table_ids); int get_table_ids(const ObIArray &table_ids, ObRelIds& rel_ids); int get_table_ids(const ObIArray &table_items, ObRelIds& table_ids); int get_table_ids(const ObIArray &exprs, ObRelIds& table_ids); int is_joined_table_filter(const ObIArray &table_items, const ObRawExpr *expr, bool &is_filter); int find_inner_conflict_detector(const ObIArray &inner_conflict_detectors, const ObRelIds &rel_ids, ConflictDetector* &detector); int satisfy_associativity_rule(const ConflictDetector &left, const ConflictDetector &right, bool &is_satisfy); int satisfy_left_asscom_rule(const ConflictDetector &left, const ConflictDetector &right, bool &is_satisfy); int satisfy_right_asscom_rule(const ConflictDetector &left, const ConflictDetector &right, bool &is_satisfy); int add_conflict_rule(const ObRelIds &left, const ObRelIds &right, ObIArray> &rules); int generate_conflict_rule(ConflictDetector *left, ConflictDetector *right, bool is_left_child, ObIArray> &rules); inline ObIArray& get_conflict_detectors() { return conflict_detectors_; } inline const ObIArray& get_conflict_detectors() const { return conflict_detectors_; } int get_base_table_items(const ObDMLStmt &stmt, const ObIArray &table_items, const ObIArray &semi_infos, ObIArray &base_tables); int generate_base_level_join_order(const common::ObIArray &table_items, common::ObIArray &base_level); int prepare_ordermap_pathset(const JoinOrderArray base_level); int select_location(ObIArray &tbl_part_info_list); int get_subplan(const ObRawExpr *expr, SubPlanInfo *&info); int get_subplan(const ObStmt *stmt, SubPlanInfo *&info); /** * Get plan signature (hash value) */ uint64_t get_signature() const { return hash_value_; } common::ObIArray &get_predicate_selectivities() { return pred_sels_; } inline common::ObIArray &get_onetime_exprs() { return onetime_exprs_; } //get expr selectivity from predicate_selectivities_ double get_expr_selectivity(const ObRawExpr *expr, bool &found); int can_be_late_materialization(bool &can_be); int check_late_materialization_project(const uint64_t table_id, const common::ObIArray &filter_exprs, const common::ObIArray &sort_exprs, const common::ObIArray &index_keys, bool &need, common::ObIArray &pre_access_columns, common::ObIArray &project_columns); int get_pre_project_cost(ObLogicalOperator *top, ObLogicalOperator *scan, common::ObIArray &index_columns, bool index_back, bool need_set, double &cost); int check_late_materialization_cost(ObLogicalOperator *top, ObLogicalOperator *scan, common::ObIArray &index_columns, common::ObIArray &table_columns, bool index_back, double min_cost, bool &need, double &get_cost, double &join_cost); static int select_one_server(const common::ObAddr &selected_server, common::ObIArray &phy_tbl_loc_info_list); int is_partition_in_same_server(const ObIArray &phy_location_infos, bool &is_same, bool &multi_part_table, common::ObAddr &first_addr); int check_enable_plan_expiration(bool &enable) const; bool need_consistent_read() const; int check_need_multi_partition_dml(const ObDMLStmt &stmt, ObLogicalOperator &top, const ObIArray &index_dml_infos, bool &is_multi_part_dml, bool &is_result_local); int check_stmt_need_multi_partition_dml(const ObDMLStmt &stmt, const ObIArray &index_dml_infos, bool &is_multi_part_dml); int check_location_need_multi_partition_dml(ObLogicalOperator &top, uint64_t table_id, bool &is_multi_part_dml, bool &is_result_local); int check_if_use_hybrid_hash_distribution(ObOptimizerContext &optimizer_ctx, const ObDMLStmt *stmt, ObJoinType join_type, ObRawExpr &expr, common::ObIArray &popular_values) const; int get_source_table_info(ObLogicalOperator &child_op, uint64_t source_table_id, ObShardingInfo *&sharding_info, ObTablePartitionInfo *&table_part_info); void set_insert_stmt(const ObInsertStmt *insert_stmt) { insert_stmt_ = insert_stmt; } const ObInsertStmt *get_insert_stmt() const { return insert_stmt_; } public: struct CandidatePlan { CandidatePlan(ObLogicalOperator *plan_tree) : plan_tree_(plan_tree) { } CandidatePlan() : plan_tree_(NULL) { } virtual ~CandidatePlan() {} void reset() { plan_tree_ = NULL; } ObLogicalOperator *plan_tree_; int64_t to_string(char *buf, const int64_t buf_len) const { UNUSED(buf); UNUSED(buf_len); return common::OB_SUCCESS; } }; struct All_Candidate_Plans { All_Candidate_Plans() : is_final_sort_(false) {} virtual ~All_Candidate_Plans() {} common::ObSEArray candidate_plans_; std::pair plain_plan_; bool is_final_sort_; void reuse() { candidate_plans_.reuse(); is_final_sort_ = false; } int get_best_plan(ObLogicalOperator *&best_plan) { int ret = common::OB_SUCCESS; best_plan = NULL; if (plain_plan_.second >= 0 && plain_plan_.second < candidate_plans_.count()) { best_plan = candidate_plans_.at(plain_plan_.second).plan_tree_; } else { ret = common::OB_ERR_UNEXPECTED; } return ret; } }; struct GroupingOpHelper { GroupingOpHelper() : can_scalar_pushdown_(false), can_basic_pushdown_(false), can_three_stage_pushdown_(false), can_rollup_pushdown_(false), force_use_hash_(false), force_use_merge_(false), force_part_sort_(false), force_normal_sort_(false), is_scalar_group_by_(false), distinct_exprs_(), aggr_code_expr_(NULL), non_distinct_aggr_items_(), distinct_aggr_items_(), distinct_params_(), rollup_id_expr_(NULL), group_ndv_(-1.0), group_distinct_ndv_(-1.0) { } virtual ~GroupingOpHelper() {} bool can_scalar_pushdown_; bool can_basic_pushdown_; bool can_three_stage_pushdown_; bool can_rollup_pushdown_; bool force_use_hash_; // has use_hash_aggregation/use_hash_distinct hint bool force_use_merge_; // has no_use_hash_aggregation/no_use_hash_distinct hint bool force_part_sort_; // force use partition sort for merge group by bool force_normal_sort_; // disable use partition sort for merge group by bool is_scalar_group_by_; ObSEArray distinct_exprs_; // context for three stage group by push down ObRawExpr *aggr_code_expr_; ObArray non_distinct_aggr_items_; ObArray distinct_aggr_items_; ObArray distinct_params_; ObArray distinct_aggr_batch_; // for rollup distributor and collector ObRawExpr *rollup_id_expr_; // distinct of group expr double group_ndv_; // distinct of group expr and distinct expr double group_distinct_ndv_; TO_STRING_KV(K_(can_scalar_pushdown), K_(can_basic_pushdown), K_(can_three_stage_pushdown), K_(can_rollup_pushdown), K_(force_use_hash), K_(force_use_merge), K_(is_scalar_group_by), K_(distinct_exprs)); }; /** * @brief Genearete a specified operator on top of a list of candidate plans * @param [out] jos - the generated Join_OrderS * @retval OB_SUCCESS execute success * @retval OB_SOME_ERROR special errno need to handle */ int generate_join_orders(); /** @brief Allcoate operator for access path */ int allocate_access_path(AccessPath *ap, ObLogicalOperator *&out_access_path_op); int allocate_cte_table_path(CteTablePath *cte_table_path, ObLogicalOperator *&out_access_path_op); int allocate_temp_table_path(TempTablePath *temp_table_path, ObLogicalOperator *&out_access_path_op); int allocate_function_table_path(FunctionTablePath *func_table_path, ObLogicalOperator *&out_access_path_op); int get_has_global_index_filters(const ObIArray &filter_exprs, const ObIArray &index_columns, bool &has_index_scan_filter, bool &has_index_lookup_filter) ; int allocate_json_table_path(JsonTablePath *json_table_path, ObLogicalOperator *&out_access_path_op); //store index column ids including storing column. int store_index_column_ids(ObSqlSchemaGuard &schema_guard, ObLogTableScan &scan, const int64_t table_id, const int64_t index_id); /** @brief Allcoate operator for join path */ int allocate_join_path(JoinPath *join_path, ObLogicalOperator *&out_join_path_op); int compute_join_exchange_info(JoinPath &join_path, ObExchangeInfo &left_exch_info, ObExchangeInfo &right_exch_info, bool left_is_non_preserve_side, bool right_is_non_preserve_side); int get_join_path_keys(const JoinPath &join_path, ObIArray &left_keys, ObIArray &right_keys, ObIArray &null_safe_info); int compute_hash_distribution_info(const ObJoinType &join_type, const bool enable_hybrid_hash_dm, const ObIArray &join_exprs, const ObRelIds &left_table_set, ObExchangeInfo &left_exch_info, ObExchangeInfo &right_exch_info); int compute_single_side_hash_distribution_info(const EqualSets &equal_sets, const ObIArray &src_keys, const ObIArray &target_keys, const Path &target_path, ObExchangeInfo &exch_info); int compute_single_side_hash_distribution_info(const EqualSets &equal_sets, const ObIArray &src_keys, const ObIArray &target_keys, const ObLogicalOperator &target_op, ObExchangeInfo &exch_info); void compute_null_distribution_info(const ObJoinType &join_type, ObExchangeInfo &left_exch_info, ObExchangeInfo &right_exch_info, ObIArray &null_safe_info); int compute_repartition_distribution_info(const EqualSets &equal_sets, const ObIArray &src_keys, const ObIArray &target_keys, const uint64_t ref_table_id, const uint64_t table_id, const ObString &table_name, const ObShardingInfo &target_sharding, ObExchangeInfo &exch_info); int compute_repartition_distribution_info(const EqualSets &equal_sets, const ObIArray &src_keys, const ObIArray &target_keys, const Path &target_path, ObExchangeInfo &exch_info); int compute_repartition_distribution_info(const EqualSets &equal_sets, const ObIArray &src_keys, const ObIArray &target_keys, const ObLogicalOperator &target_op, ObExchangeInfo &exch_info); int compute_subplan_filter_repartition_distribution_info(ObLogicalOperator *top, const ObIArray &subquery_ops, const ObIArray ¶ms, ObExchangeInfo &exch_info); int find_base_sharding_table_scan(const ObLogicalOperator &op, const ObLogTableScan *&tsc); int get_repartition_table_info(const ObLogicalOperator &op, ObString &table_name, uint64_t &ref_table_id, uint64_t &table_id); int compute_repartition_func_info(const EqualSets &equal_sets, const ObIArray &src_keys, const ObIArray &target_keys, const ObShardingInfo &target_sharding, ObRawExprFactory &expr_factory, ObExchangeInfo &exch_info); int get_repartition_keys(const EqualSets &equal_sets, const ObIArray &src_keys, const ObIArray &target_keys, const ObIArray &target_part_keys, ObIArray &src_part_keys); /** @brief Allcoate operator for subquery path */ int allocate_subquery_path(SubQueryPath *subpath, ObLogicalOperator *&out_subquery_op); /** @brief Allcoate a ,aterial operator as parent of a path */ int allocate_material_as_top(ObLogicalOperator *&old_top); /** @brief Create plan tree from an interesting order */ int create_plan_tree_from_path(Path *path, ObLogicalOperator *&out_plan_tree); /** @brief Initialize the candidate plans from join order */ int init_candidate_plans(); int init_candidate_plans(ObIArray &candi_plans); int candi_allocate_scala_group_by(const ObIArray &agg_items); int candi_allocate_scala_group_by(const ObIArray &agg_items, const ObIArray &having_exprs, const bool is_from_povit); int prepare_three_stage_info(const ObIArray &group_by_exprs, const ObIArray &rollup_exprs, GroupingOpHelper &helper); int generate_three_stage_aggr_expr(ObRawExprFactory &expr_factory, ObSQLSessionInfo &session_info, const bool is_rollup, ObAggFunRawExpr *aggr, ObIArray &distinct_aggr_batch, ObIArray &distinct_params); bool disable_hash_groupby_in_second_stage(); int create_three_stage_group_plan(const ObIArray &group_by_exprs, const ObIArray &rollup_exprs, const ObIArray &having_exprs, GroupingOpHelper &helper, ObLogicalOperator *&top); int perform_group_by_pushdown(ObLogicalOperator *op); int perform_simplify_win_expr(ObLogicalOperator *op); int perform_adjust_onetime_expr(ObLogicalOperator *op); int init_onetime_replaced_exprs_if_needed(); int set_advisor_table_id(ObLogicalOperator *op); int negotiate_advisor_table_id(ObLogicalOperator *op); int simplify_win_expr(ObLogicalOperator* child_op, ObWinFunRawExpr &win_expr); int simplify_win_partition_exprs(ObLogicalOperator* child_op, ObWinFunRawExpr &win_expr); int simplify_win_order_items(ObLogicalOperator* child_op, ObWinFunRawExpr &win_expr); int perform_window_function_pushdown(ObLogicalOperator *op); int try_to_generate_pullup_aggr(ObAggFunRawExpr *old_aggr, ObAggFunRawExpr *&new_aggr); int create_scala_group_plan(const ObIArray &agg_items, const ObIArray &having_exprs, const bool is_from_povit, GroupingOpHelper &groupby_helper, ObLogicalOperator *&top); int check_can_pullup_gi(ObLogicalOperator &top, bool is_partition_wise, bool need_sort, bool &can_pullup); int try_push_aggr_into_table_scan(ObLogicalOperator *top, const ObIArray &aggr_items); int get_grouping_style_exchange_info(const common::ObIArray &partition_exprs, const EqualSets &equal_sets, ObExchangeInfo &exch_info); int init_groupby_helper(const ObIArray &groupby_exprs, const ObIArray &rollup_exprs, const ObIArray &aggr_items, const bool is_from_povit, GroupingOpHelper &groupby_helper); int init_distinct_helper(const ObIArray &distinct_exprs, GroupingOpHelper &distinct_helper); bool is_tenant_enable_aggr_push_down(ObSQLSessionInfo &session_info); int check_scalar_groupby_pushdown(const ObIArray &aggrs, bool &can_push); int check_basic_groupby_pushdown(const ObIArray &aggr_items, const EqualSets &equal_sets, bool &push_group); int check_three_stage_groupby_pushdown(const ObIArray &rollup_exprs, const ObIArray &aggr_items, ObIArray &non_distinct_aggrs, ObIArray &distinct_aggrs, const EqualSets &equal_sets, ObIArray &distinct_exprs, bool &can_push); int check_rollup_pushdown(const ObSQLSessionInfo *info, const ObIArray &aggr_items, bool &can_push); int adjust_sort_expr_ordering(ObIArray &sort_exprs, ObIArray &sort_directions, ObLogicalOperator &child_op, bool check_win_func); int adjust_exprs_by_win_func(ObIArray &exprs, const ObWinFunRawExpr &win_expr, const EqualSets &equal_sets, const ObIArray &conditions, ObIArray &directions); int adjust_postfix_sort_expr_ordering(const ObIArray &ordering, const ObFdItemSet &fd_item_set, const EqualSets &equal_sets, const ObIArray &const_exprs, const int64_t prefix_count, ObIArray &sort_exprs, ObIArray &sort_directions); int get_minimal_cost_candidates(const ObIArray &candidates, ObIArray &best_candidates); int get_minimal_cost_candidates(const ObIArray> &candidate_list, ObIArray &best_candidates); int get_minimal_cost_candidate(const ObIArray &candidates, CandidatePlan &best_candidate); int classify_candidates_based_on_sharding(const ObIArray &candidates, ObIArray> &candidate_list); /** @brief Allocate ORDER BY on top of plan candidates */ int candi_allocate_order_by(bool &need_limit, ObIArray &order_items); int get_order_by_topn_expr(int64_t input_card, ObRawExpr *&topn_expr, bool &is_fetch_with_ties, bool &need_limit); /** @brief Get order by columns */ int get_order_by_exprs(const ObLogicalOperator *top, common::ObIArray &order_by_exprs, common::ObIArray *directions = NULL); // @brief Make OrderItems by exprs int make_order_items(const common::ObIArray &exprs, const common::ObIArray *dirs, common::ObIArray &items); int make_order_items(const common::ObIArray &exprs, common::ObIArray &items); int make_order_items(const common::ObIArray &exprs, const common::ObIArray &dirs, common::ObIArray &items); int create_order_by_plan(ObLogicalOperator *&top, const ObIArray &order_items, ObRawExpr *topn_expr, bool is_fetch_with_ties); int allocate_sort_and_exchange_as_top(ObLogicalOperator *&top, ObExchangeInfo &exch_info, const ObIArray &sort_keys, const bool need_sort, const int64_t prefix_pos, const bool is_partition_wise, ObRawExpr *topn_expr = NULL, bool is_fetch_with_ties = false, OrderItem *hash_sortkey = NULL); int allocate_dist_range_sort_as_top(ObLogicalOperator *&top, const ObIArray &sort_keys, const bool need_sort, const bool is_local_order); int try_allocate_sort_as_top(ObLogicalOperator *&top, const ObIArray &sort_keys, const bool need_sort, const int64_t prefix_pos, const int64_t part_cnt = 0); int allocate_sort_as_top(ObLogicalOperator *&top, const ObIArray &sort_keys, const int64_t prefix_pos = 0, const bool is_local_merge_sort = false, ObRawExpr *topn_expr = NULL, bool is_fetch_with_ties = false, OrderItem *hash_sortkey = NULL); int allocate_exchange_as_top(ObLogicalOperator *&top, const ObExchangeInfo &exch_info); int allocate_stat_collector_as_top(ObLogicalOperator *&top, ObStatCollectorType stat_type, const ObIArray &sort_keys, share::schema::ObPartitionLevel part_level); int allocate_scala_group_by_as_top(ObLogicalOperator *&top, const ObIArray &agg_items, const ObIArray &having_exprs, const bool from_pivot, const double origin_child_card); int allocate_group_by_as_top(ObLogicalOperator *&top, const AggregateAlgo algo, const ObIArray &group_by_exprs, const ObIArray &rollup_exprs, const ObIArray &agg_items, const ObIArray &having_exprs, const bool from_pivot, const double total_ndv, const double origin_child_card, const bool is_partition_wise = false, const bool is_push_down = false, const bool is_partition_gi = false, const ObRollupStatus rollup_status = ObRollupStatus::NONE_ROLLUP); int candi_allocate_limit(const ObIArray &order_items); /** @brief Allocate LIMIT on top of plan candidates */ int candi_allocate_limit(ObRawExpr *limit_expr, ObRawExpr *offset_expr = NULL, ObRawExpr *percent_expr = NULL, const bool is_calc_found_rows = false, const bool is_top_limit = false, const bool is_fetch_with_ties = false, const ObIArray *ties_ordering = NULL); int create_limit_plan(ObLogicalOperator *&old_top, ObRawExpr *limit_expr, ObRawExpr *pushed_expr, ObRawExpr *offset_expr, ObRawExpr *percent_expr, const bool is_calc_found_rows, const bool is_top_limit, const bool is_fetch_with_ties, const ObIArray *ties_ordering); int try_push_limit_into_table_scan(ObLogicalOperator *top, ObRawExpr *limit_expr, ObRawExpr *pushed_expr, ObRawExpr *offset_expr, bool &is_pushed); int allocate_limit_as_top(ObLogicalOperator *&old_top, ObRawExpr *limit_expr, ObRawExpr *offset_expr, ObRawExpr *percent_expr, const bool is_calc_found_rows, const bool is_top_limit, const bool is_fetch_with_ties, const ObIArray *ties_order_item = NULL); int is_plan_reliable(const ObLogicalOperator *root, bool &is_reliable); /** @brief Allocate sequence op on top of plan candidates */ int candi_allocate_sequence(); int allocate_sequence_as_top(ObLogicalOperator *&old_top); int candi_allocate_err_log(const ObDelUpdStmt *stmt); int allocate_err_log_as_top(const ObDelUpdStmt *stmt, ObLogicalOperator *&old_top); /** @brief Allocate SELECTINTO on top of plan candidates */ int candi_allocate_select_into(); /** @brief allocate select into as new top(parent)**/ int allocate_select_into_as_top(ObLogicalOperator *&old_top); int allocate_expr_values_as_top(ObLogicalOperator *&top, const ObIArray *filter_exprs = NULL); int allocate_values_as_top(ObLogicalOperator *&old_top); int allocate_temp_table_insert_as_top(ObLogicalOperator *&top, const ObSqlTempTableInfo *temp_table_info); int candi_allocate_temp_table_transformation(); int create_temp_table_transformation_plan(ObLogicalOperator *&top, const ObIArray &temp_table_insert); int check_basic_sharding_for_temp_table(ObLogicalOperator *&top, const ObIArray &temp_table_insert, bool &is_basic); int allocate_temp_table_transformation_as_top(ObLogicalOperator *&top, const ObIArray &temp_table_insert); int candi_allocate_root_exchange(); /** * Plan tree traversing(both top-down and bottom-up) */ int plan_tree_traverse(const TraverseOp &operation, void *ctx); inline void set_signature(uint64_t hash_value) { hash_value_ = hash_value; } int candi_allocate_subplan_filter_for_where(); int candi_allocate_subplan_filter_for_exprs(ObIArray &exprs); int candi_allocate_subplan_filter(const ObIArray &subquery_exprs, const ObIArray *filters = NULL, const bool is_update_set = false, const bool for_on_condition = false); int inner_candi_allocate_subplan_filter(ObIArray &subplans, ObIArray &query_refs, ObIArray ¶ms, ObIArray &onetime_exprs, ObBitSet<> &initplan_idxs, ObBitSet<> &onetime_idxs, const ObIArray *filters, const bool or_cursor_expr, const bool is_update_set); int generate_subplan_filter_info(const ObIArray &subquery_exprs, ObIArray &subquery_ops, ObIArray &query_refs, ObIArray &exec_params, ObIArray &onetime_exprs, ObBitSet<> &initplan_idxs, ObBitSet<> &onetime_idxs, bool &for_cursor_expr, bool for_on_condition); int adjust_expr_with_onetime(ObRawExpr *&expr); int adjust_exprs_with_onetime(const ObIArray &exprs, ObIArray &new_exprs); int adjust_exprs_with_onetime(ObIArray &exprs); int create_subplan_filter_plan(ObLogicalOperator *&top, const ObIArray &subquery_ops, const ObIArray &dist_subquery_ops, const ObIArray &query_refs, const ObIArray ¶ms, const ObIArray &onetime_exprs, const ObBitSet<> &initplan_idxs, const ObBitSet<> &onetime_idxs, const bool for_cursor_expr, const ObIArray *filters, const bool is_update_set); int check_contains_recursive_cte(ObIArray &child_ops, bool &is_recursive_cte); int init_subplan_filter_child_ops(const ObIArray &subquery_ops, const ObIArray> ¶ms, ObIArray &dist_subquery_ops); int check_if_subplan_filter_match_partition_wise(ObLogicalOperator *top, const ObIArray &subquery_ops, const ObIArray ¶ms, bool &is_partition_wise); int check_if_subplan_filter_match_repart(ObLogicalOperator *top, const ObIArray &subquery_ops, const ObIArray ¶ms, bool &is_match_repart); int check_if_match_none_all(ObLogicalOperator *top, const ObIArray &subquery_ops, bool &is_none_all); int get_subplan_filter_equal_keys(ObLogicalOperator *child, const ObIArray ¶ms, ObIArray &left_keys, ObIArray &right_keys, ObIArray &null_safe_info); int get_subplan_filter_normal_equal_keys(const ObLogicalOperator *child, ObIArray &left_keys, ObIArray &right_keys, ObIArray &null_safe_info); int get_subplan_filter_correlated_equal_keys(const ObLogicalOperator *op, const ObIArray ¶ms, ObIArray &left_keys, ObIArray &right_keys, ObIArray &null_safe_info); int allocate_subplan_filter_as_top(ObLogicalOperator *&top, const ObIArray &subquery_ops, const ObIArray &query_ref_exprs, const ObIArray &exec_params, const ObIArray &onetime_exprs, const ObBitSet<> &initplan_idxs, const ObBitSet<> &onetime_idxs, const ObIArray *filters, const DistAlgo dist_algo, const bool is_update_set); int allocate_subplan_filter_as_top(ObLogicalOperator *&old_top, const common::ObIArray &subquery_exprs, const bool is_filter = false, const bool for_on_condition = false); int allocate_subplan_filter_for_on_condition(ObIArray &subquery_exprs, ObLogicalOperator* &top); int candi_allocate_filter(const ObIArray &filter_exprs); int candi_allocate_count(); int classify_rownum_exprs(const common::ObIArray &rownum_exprs, common::ObIArray &filter_exprs, common::ObIArray &start_exprs, ObRawExpr *&limit_expr); int classify_rownum_expr(const ObItemType expr_type, ObRawExpr *rownum_expr, ObRawExpr *const_expr, common::ObIArray &filter_exprs, common::ObIArray &start_exprs, ObRawExpr *&limit_expr); int create_rownum_plan(ObLogicalOperator *&old_top, const common::ObIArray &filter_exprs, const common::ObIArray &start_exprs, ObRawExpr *limit_expr, ObRawExpr *rownum_expr); int allocate_count_as_top(ObLogicalOperator *&old_top, const common::ObIArray &filter_exprs, const common::ObIArray &start_exprs, ObRawExpr *limit_expr, ObRawExpr *rownum_expr); All_Candidate_Plans &get_candidate_plans() { return candidates_; } const ObRawExprSets &get_empty_expr_sets() { return empty_expr_sets_; } const ObFdItemSet &get_empty_fd_item_set() { return empty_fd_item_set_; } const ObRelIds &get_empty_table_set() { return empty_table_set_; } ObRelIds &get_subq_pdfilter_tset() { return subq_pushdown_filter_table_set_; } inline common::ObIArray &get_subquery_filters() { return subquery_filters_; } int init_plan_info(); int collect_subq_pushdown_filter_table_relids(const ObIArray &quals); EqualSets &get_equal_sets() { return equal_sets_; } const EqualSets &get_equal_sets() const { return equal_sets_; } // 获取log plan中所有在执行期需要使用到的表达式 int set_all_exprs(const ObAllocExprContext &ctx); EqualSets* create_equal_sets(); ObJoinOrder* create_join_order(PathType type); const common::ObIArray &get_subplans() const { return subplan_infos_; } inline OptTableMetas& get_basic_table_metas() { return basic_table_metas_; } inline const OptTableMetas& get_basic_table_metas() const { return basic_table_metas_; } inline OptTableMetas& get_update_table_metas() { return update_table_metas_; } inline const OptTableMetas& get_update_table_metas() const { return update_table_metas_; } inline OptSelectivityCtx& get_selectivity_ctx() { return selectivity_ctx_; } inline const OptSelectivityCtx& get_selectivity_ctx() const { return selectivity_ctx_; } inline bool get_is_subplan_scan() const { return is_subplan_scan_; } inline void set_is_subplan_scan(bool is_subplan_scan) { is_subplan_scan_ = is_subplan_scan; } inline bool get_is_parent_set_distinct() const { return is_parent_set_distinct_; } inline void set_is_parent_set_distinct(bool is_parent_set_distinct) { is_parent_set_distinct_ = is_parent_set_distinct; } inline ObSqlTempTableInfo* get_temp_table_info() const { return temp_table_info_; } inline bool is_temp_table() const { return NULL != temp_table_info_; } inline void set_temp_table_info(ObSqlTempTableInfo *temp_table_info) { temp_table_info_ = temp_table_info; } inline bool is_final_root_plan() const { const ObDMLStmt *root_stmt = optimizer_context_.get_root_stmt(); return OB_NOT_NULL(root_stmt) && ((root_stmt->is_explain_stmt() && static_cast(root_stmt)->get_explain_query_stmt() == stmt_) || stmt_ == root_stmt); } inline common::ObIArray &get_const_exprs() { return const_exprs_; } inline const common::ObIArray &get_const_exprs() const { return const_exprs_; } inline int add_pushdown_filters(const common::ObIArray &pushdown_filters) { return append(pushdown_filters_, pushdown_filters); } inline common::ObIArray &get_pushdown_filters() { return pushdown_filters_; } inline const common::ObIArray &get_pushdown_filters() const { return pushdown_filters_; } int init_onetime_subquery_info(); int extract_onetime_subquery(ObRawExpr *expr, ObIArray &onetime_list, bool &is_valid); int create_onetime_param(ObRawExpr *expr, const ObIArray &onetime_list); int extract_onetime_exprs(ObRawExpr *expr, ObIArray &onetime_exprs, ObIArray &onetime_query_refs, const bool for_on_condition); int contains_startup_with_exec_param(ObLogicalOperator *op, bool &contains); int contains_limit_or_pushdown_limit(ObLogicalOperator *op, bool &contains); int replace_generate_column_exprs(ObLogicalOperator *op); int generate_old_column_values_exprs(ObLogicalOperator *root); int generate_tsc_replace_exprs_pair(ObLogTableScan *op); int generate_ins_replace_exprs_pair(ObLogDelUpd *op); int generate_old_column_exprs(ObIArray &index_dml_infos); /** * 递归处理expr里的SubQuery，遇到SubLink就生成一个SubPlan * @param expr * @return */ int generate_subplan(ObRawExpr *&expr); int add_startup_filters(common::ObIArray &exprs) { return append(startup_filters_, exprs); } inline common::ObIArray &get_startup_filters() { return startup_filters_; } /** * width estimation related info */ inline common::ObIArray &get_select_item_exprs_for_width_est() { return select_item_exprs_; } inline common::ObIArray &get_condition_exprs_for_width_est() { return condition_exprs_; } inline common::ObIArray &get_groupby_rollup_exprs_for_width_est() { return groupby_rollup_exprs_; } inline common::ObIArray &get_having_exprs_for_width_est() { return having_exprs_; } inline common::ObIArray &get_orderby_exprs_for_width_est() { return orderby_exprs_; } inline common::ObIArray &get_winfunc_exprs_for_width_est() { return winfunc_exprs_; } inline ObIArray &get_hash_dist_info() { return hash_dist_info_; } int get_cached_hash_sharding_info(const ObIArray &hash_exprs, const EqualSets &equal_sets, ObShardingInfo *&cached_sharding); inline const common::ObIArray &get_function_table_depend_infos() const { return function_table_depend_infos_; } inline const common::ObIArray &get_json_table_depend_infos() const { return json_table_depend_infos_; } int allocate_output_expr_for_values_op(ObLogicalOperator &values_op); inline common::ObIArray &get_recycled_join_paths() { return recycled_join_paths_; } int get_rowkey_exprs(const uint64_t table_id, const uint64_t ref_table_id, ObIArray &keys); int get_rowkey_exprs(const uint64_t table_id, const ObTableSchema &table_schema, ObIArray &keys); int get_index_column_items(ObRawExprFactory &expr_factory, uint64_t table_id, const share::schema::ObTableSchema &index_table_schema, common::ObIArray &index_columns); int get_column_exprs(uint64_t table_id, ObIArray &column_exprs) const; ObColumnRefRawExpr *get_column_expr_by_id(uint64_t table_id, uint64_t column_id) const; const ColumnItem *get_column_item_by_id(uint64_t table_id, uint64_t column_id) const; inline common::ObIArray &get_column_items() { return column_items_; } int generate_column_expr(ObRawExprFactory &expr_factory, const uint64_t &table_id, const ObColumnSchemaV2 &column_schema, ColumnItem &column_item); common::ObIArray &get_alloc_sfu_list() { return alloc_sfu_list_; } int merge_same_sfu_table_list(uint64_t target_id, int64_t begin_idx, ObIArray &src_table_list, ObIArray &res_table_list); /** * @brief candi_allocate_for_update * allocate for update operator * @return */ int candi_allocate_for_update(); /** @brief Allcoate a ,for update operator as parent of a path */ int allocate_for_update_as_top(ObLogicalOperator *&top, ObIArray &sfu_table_list); int get_table_for_update_info(const uint64_t table_id, IndexDMLInfo *&index_dml_info, int64_t &wait_ts, bool &skip_locked); int get_part_column_exprs(const uint64_t table_id, const uint64_t ref_table_id, common::ObIArray &part_exprs) const; int create_for_update_plan(ObLogicalOperator *&top, const ObIArray &index_dml_infos, int64_t wait_ts, bool skip_locked, ObRawExpr *lock_rownum); int allocate_for_update_as_top(ObLogicalOperator *&top, const bool is_multi_part_dml, const ObIArray &index_dml_infos, int64_t wait_ts, bool skip_locked, ObRawExpr *lock_rownum); bool table_is_allocated_for_update(const int64_t table_id); virtual int add_extra_dependency_table() const; int gen_calc_part_id_expr(uint64_t table_id, uint64_t ref_table_id, CalcPartIdType calc_id_type, ObRawExpr *&expr); int candi_allocate_for_update_material(); int allocate_material_for_recursive_cte_plan(ObIArray &child_ops); int find_possible_join_filter_tables(ObLogicalOperator *op, const JoinFilterPushdownHintInfo &hint_info, ObRelIds &right_tables, bool is_current_dfo, bool is_fully_partition_wise, int64_t current_dfo_level, const ObIArray &left_join_conditions, const ObIArray &right_join_conditions, ObIArray &join_filter_infos); int pushdown_join_filter_into_subquery(const ObDMLStmt *parent_stmt, ObLogicalOperator* child_op, uint64_t subquery_id, const JoinFilterPushdownHintInfo &hint_info, bool is_current_dfo, bool is_fully_partition_wise, int64_t current_dfo_level, const ObIArray &left_join_conditions, const ObIArray &right_join_conditions, ObIArray &join_filter_infos); int get_join_filter_exprs(const ObIArray &left_join_conditions, const ObIArray &right_join_conditions, JoinFilterInfo &join_filter_info); int fill_join_filter_info(JoinFilterInfo &join_filter_info); int perform_gather_stat_replace(ObLogicalOperator *op); protected: virtual int generate_normal_raw_plan() = 0; virtual int generate_dblink_raw_plan(); int update_plans_interesting_order_info(ObIArray &candidate_plans, const int64_t check_scope); int prune_and_keep_best_plans(ObIArray &candidate_plans); int add_candidate_plan(common::ObIArray ¤t_plans, const CandidatePlan &new_plan); int compute_plan_relationship(const CandidatePlan &first_plan, const CandidatePlan &second_plan, DominateRelation &relation); int compute_pipeline_relationship(const ObLogicalOperator &first_plan, const ObLogicalOperator &second_plan, DominateRelation &relation); int get_start_with_filter(const ObDMLStmt *stmt, common::ObIArray *&start_with_filters); int distribute_start_with_filters_to_rels(common::ObIArray &baserels, common::ObIArray &start_with_filters); int distribute_quals_to_rels(const common::ObIArray &table_items, const common::ObIArray &semi_infos, common::ObIArray &baserels, common::ObIArray &quals); int try_split_or_qual(const ObRelIds &table_ids, ObOpRawExpr &or_qual, ObIArray &table_quals); int split_or_quals(const ObIArray &table_items, ObIArray &quals); int split_or_quals(const ObIArray &table_items, ObRawExpr *qual, ObIArray &new_quals); int pre_process_quals(const ObIArray &table_items, const ObIArray &semi_infos, ObIArray &quals); int pre_process_quals(SemiInfo* semi_info); int pre_process_quals(TableItem *table_item); int generate_conflict_detectors(const ObIArray &table_items, const ObIArray &semi_infos, ObIArray &quals, ObIArray &baserels); int generate_semi_join_detectors(const ObIArray &semi_infos, ObRelIds &left_rel_ids, const ObIArray &inner_join_detectors, ObIArray &semi_join_detectors); int generate_inner_join_detectors(const ObIArray &table_items, ObIArray &quals, ObIArray &baserels, ObIArray &inner_join_detectors); int generate_outer_join_detectors(TableItem *table_item, ObIArray &table_filter, ObIArray &baserels, ObIArray &outer_join_detectors); int mock_base_rel_detectors(ObJoinOrder *&base_rel); int distribute_quals(TableItem *table_item, const ObIArray &table_filter, ObIArray &baserels); int flatten_inner_join(TableItem *table_item, ObIArray &table_filter, ObIArray &table_items); int inner_generate_outer_join_detectors(JoinedTable *joined_table, ObIArray &table_filter, ObIArray &baserels, ObIArray &outer_join_detectors); int pushdown_where_filters(JoinedTable* joined_table, ObIArray &table_filter, ObIArray &left_quals, ObIArray &right_quals); int pushdown_on_conditions(JoinedTable* joined_table, ObIArray &left_quals, ObIArray &right_quals, ObIArray &join_quals); int generate_cross_product_detector(const ObIArray &table_items, ObIArray &quals, ObIArray &cross_product_detectors); int check_join_info(const ObRelIds &left, const ObRelIds &right, const ObIArray &base_table_ids, bool &is_connected); int generate_cross_product_conflict_rule(ConflictDetector *cross_product_detector, const ObIArray &table_items, const ObIArray &join_conditions); int init_leading_info_from_joined_tables(TableItem *table); int init_leading_info_from_tables(const ObIArray &table_items, const ObIArray &semi_infos); int find_join_order_pair(uint8_t beg_pos, uint8_t &end_pos, uint8_t ignore_beg_pos, uint8_t &ignore_end_pos, bool &found); int get_table_ids_from_leading(uint8_t pos, ObRelIds& table_ids); int init_leading_info_from_leading_pair(uint8_t beg_pos, uint8_t end_pos, ObRelIds &table_set); int init_leading_info_from_leading(); int init_leading_info(const ObIArray &table_items, const ObIArray &semi_infos); int init_bushy_tree_info(const ObIArray &table_items); int init_bushy_tree_info_from_joined_tables(TableItem *table); int init_function_table_depend_info(const ObIArray &table_items); int init_json_table_depend_info(const ObIArray &table_items); int check_need_bushy_tree(common::ObIArray &join_rels, const int64_t join_level, bool &need); int init_width_estimation_info(const ObDMLStmt *stmt); int init_idp(int64_t initial_idp_step, common::ObIArray &idp_join_rels, common::ObIArray &full_join_rels); int generate_join_levels_with_IDP(common::ObIArray &join_rels); int inner_generate_join_levels_with_IDP(common::ObIArray &join_rels, bool ignore_hint); int generate_join_levels_with_orgleading(common::ObIArray &join_rels); int do_one_round_idp(common::ObIArray &temp_join_rels, uint32_t curr_idp_step, bool ignore_hint, uint32_t &outer_base_level, ObIDPAbortType &abort_type); int process_join_level_info(const ObIArray &table_items, ObIArray &join_rels, ObIArray &new_join_rels); int generate_join_order_with_table_tree(ObIArray &join_rels, TableItem *table, ObJoinOrder* &join_tree); int generate_single_join_level_with_DP(ObIArray &join_rels, uint32_t left_level, uint32_t right_level, uint32_t level, bool ignore_hint, ObIDPAbortType &abort_type); int inner_generate_join_order(ObIArray &join_rels, ObJoinOrder *left_tree, ObJoinOrder *right_tree, uint32_t level, bool force_order, bool delay_cross_product, bool &is_valid_join, ObJoinOrder *&join_tree); int is_detector_used(ObJoinOrder *left_tree, ObJoinOrder *right_tree, ConflictDetector *detector, bool &is_used); int choose_join_info(ObJoinOrder *left_tree, ObJoinOrder *right_tree, ObIArray &valid_detectors, bool delay_cross_product, bool &is_strict_order); int check_join_info(const ObIArray &valid_detectors, ObJoinType &join_type, bool &is_valid); int merge_join_info(ObJoinOrder *left_tree, ObJoinOrder *right_tree, const ObIArray &valid_detectors, JoinInfo &join_info); int remove_redundancy_pred(ObJoinOrder *left_tree, ObJoinOrder *right_tree, JoinInfo &join_info); int try_keep_pred_join_same_tables(ObJoinOrder *left_tree, ObJoinOrder *right_tree, ObIArray &join_pred); int join_side_from_one_table(ObJoinOrder &child_tree, ObIArray &join_pred, bool &is_valid, ObRelIds &intersect_rel_ids); int re_add_necessary_predicate(ObIArray &join_pred, ObIArray &new_join_pred, ObIArray &skip, EqualSets &equal_sets); int inner_remove_redundancy_pred(ObIArray &join_pred, EqualSets &equal_sets, ObJoinOrder *left_tree, ObJoinOrder *right_tree); int sort_qual_by_selectivity(ObIArray &join_pred); int generate_subplan_for_query_ref(ObQueryRefRawExpr *query_ref, SubPlanInfo *&subplan_info); int greedy_idp_best_order(uint32_t current_level, common::ObIArray &idp_join_rels, ObJoinOrder *&best_order); int prepare_next_round_idp(common::ObIArray &idp_join_rels, uint32_t initial_idp_step, ObJoinOrder *&best_order); int check_and_abort_curr_level_dp(common::ObIArray &idp_join_rels, uint32_t curr_level, ObIDPAbortType &abort_type); int check_and_abort_curr_round_idp(common::ObIArray &idp_join_rels, uint32_t curr_level, ObIDPAbortType &abort_type); /** * SubPlanInfo相关接口 * @return */ inline common::ObIArray &get_subplans() { return subplan_infos_; } inline int64_t get_subplan_size() { return subplan_infos_.count(); } int add_subplan(SubPlanInfo *plan) { return subplan_infos_.push_back(plan); } int add_subquery_filter(ObRawExpr *qual); bool is_correlated_expr(const ObStmt *stmt, const ObRawExpr *expr, const int32_t curlevel); int add_rownum_expr(ObRawExpr *expr) { return rownum_exprs_.push_back(expr); } inline common::ObIArray &get_rownum_exprs() { return rownum_exprs_; } int add_special_expr(ObRawExpr *expr) { return special_filters_.push_back(expr); } inline common::ObIArray &get_special_exprs() { return special_filters_; } int add_startup_filter(ObRawExpr *expr) { return startup_filters_.push_back(expr); } /** * 处理scalar_in，转成or形式 * @param expr * @return */ int process_scalar_in(ObRawExpr *&expr); /** * 根据表的id找到基表（其实这里不一定是基表，而是fromitem里的基本对象，可以是用户写的OJ，也可能是个SubQueryScan） * @param base_level * @param table_id * @return */ int find_base_rel(common::ObIArray &base_level, int64_t table_idx, ObJoinOrder *&base_rel); /** * 根据relids找到一个joinrel * @param join_level * @param relids * @return */ int find_join_rel(ObRelIds &relids, ObJoinOrder *&join_rel); int check_need_gen_join_path(const ObJoinOrder *left_tree, const ObJoinOrder *right_tree, bool &need_gen); int check_join_legal(const ObRelIds &left_set, const ObRelIds &right_set, const ObRelIds &combined_set, ConflictDetector *detector, bool delay_cross_product, bool &legal); int check_join_hint(const ObRelIds &left_set, const ObRelIds &right_set, bool &match_hint, bool &is_legal, bool &is_strict_order); // 用于计算 px 场景下 select、update 等语句需要的线程数 int calc_plan_resource(); int get_cache_calc_part_id_expr(int64_t table_id, int64_t ref_table_id, CalcPartIdType calc_type, ObRawExpr* &expr); int get_part_exprs(uint64_t table_id, uint64_t ref_table_id, share::schema::ObPartitionLevel &part_level, ObRawExpr *&part_expr, ObRawExpr *&subpart_expr); int create_hash_sortkey(const int64_t part_cnt, const common::ObIArray &order_keys, OrderItem &hash_sortkey); private: // member functions static int strong_select_replicas(const common::ObAddr &local_server, common::ObIArray &phy_tbl_loc_info_list, bool &is_hit_partition, bool sess_in_retry); static int weak_select_replicas(const common::ObAddr &local_server, ObRoutePolicyType route_type, bool proxy_priority_hit_support, uint64_t tenant_id, int64_t max_read_stale_time, common::ObIArray &phy_tbl_loc_info_list, bool &is_hit_partition, share::ObFollowerFirstFeedbackType &follower_first_feedback); static int calc_hit_partition_for_compat(const common::ObIArray &phy_tbl_loc_info_list, const common::ObAddr &local_server, bool &is_hit_partition, ObAddrList &intersect_servers); static int calc_follower_first_feedback(const common::ObIArray &phy_tbl_loc_info_list, const common::ObAddr &local_server, const ObAddrList &intersect_servers, share::ObFollowerFirstFeedbackType &follower_first_feedback); int set_connect_by_property(JoinPath *join_path, ObLogJoin &log_join); static int calc_intersect_servers(const ObIArray &phy_tbl_loc_info_list, ObList &candidate_server_list); int calc_and_set_exec_pwj_map(ObLocationConstraintContext &location_constraint) const; int check_pwj_cons(const ObPwjConstraint &pwj_cons, const common::ObIArray &base_location_cons, ObStrictPwjComparer &pwj_comparer, PWJTabletIdMap &pwj_map) const; bool has_depend_function_table(const ObRelIds& table_ids); int get_histogram_by_join_exprs(ObOptimizerContext &optimizer_ctx, const ObDMLStmt *stmt, const ObRawExpr &expr, ObOptColumnStatHandle &handle) const; int get_popular_values_hash(common::ObIAllocator &allocator, ObOptColumnStatHandle &handle, common::ObIArray &popular_values) const; bool has_depend_json_table(const ObRelIds& table_ids); int adjust_expr_properties_for_external_table(ObRawExpr *col_expr, ObRawExpr *&expr) const; public: const ObLogPlanHint &get_log_plan_hint() const { return log_plan_hint_; } bool has_join_order_hint() { return !log_plan_hint_.join_order_.leading_tables_.is_empty(); } const ObRelIds& get_leading_tables() { return log_plan_hint_.join_order_.leading_tables_; } void set_added_leading() { outline_print_flags_ |= ADDED_LEADING_HINT; } void reset_outline_print_flags() { outline_print_flags_ = 0; } bool has_added_leading() const { return outline_print_flags_ & ADDED_LEADING_HINT; } const common::ObIArray &get_onetime_query_refs() const { return onetime_query_refs_; } private: static const int64_t IDP_PATHNUM_THRESHOLD = 5000; protected: // member variable ObOptimizerContext &optimizer_context_; common::ObIAllocator &allocator_; const ObDMLStmt *stmt_; ObLogOperatorFactory log_op_factory_; All_Candidate_Plans candidates_; common::ObSEArray, 4, common::ModulePageAllocator, true > group_replaced_exprs_; common::ObSEArray, 4, common::ModulePageAllocator, true > window_function_replaced_exprs_; common::ObSEArray, 4, common::ModulePageAllocator, true > gen_col_replaced_exprs_; common::ObSEArray, 1, common::ModulePageAllocator, true > stat_gather_replaced_exprs_; // used for gather statistic begin ObRawExpr* stat_partition_id_expr_; ObLogTableScan* stat_table_scan_; // used for gather statistics end //上层stmt条件下推下来的谓词，已经抽出？ common::ObSEArray pushdown_filters_; common::ObSEArray startup_filters_; private: // member variable //如果这个plan是一个子查询，并且出现在expr的位置上，这个指针指向引用这个plan的的表达式 ObQueryRefRawExpr *query_ref_; ObLogicalOperator *root_; // root operator common::ObString sql_text_; // SQL string uint64_t hash_value_; // plan signature common::ObSEArray subquery_filters_; common::ObSEArray subplan_infos_; common::ObSEArray rownum_exprs_; common::ObSEArray special_filters_; //filter at root join order // for width estimation common::ObSEArray select_item_exprs_; common::ObSEArray condition_exprs_; common::ObSEArray groupby_rollup_exprs_; common::ObSEArray having_exprs_; common::ObSEArray orderby_exprs_; common::ObSEArray winfunc_exprs_; private: struct JoinPathPairInfo { JoinPathPairInfo() : left_ids_(), right_ids_() {} virtual ~JoinPathPairInfo() = default; uint64_t hash() const { return left_ids_.hash() + right_ids_.hash();; } int hash(uint64_t &hash_val) const { hash_val = hash(); return OB_SUCCESS; } bool operator ==(const JoinPathPairInfo &src_info) const { return (left_ids_ == src_info.left_ids_) && (right_ids_ == src_info.right_ids_); } TO_STRING_KV(K_(left_ids), K_(right_ids)); ObRelIds left_ids_; ObRelIds right_ids_; }; typedef common::ObPooledAllocator::AllocType, common::ObWrapperAllocator> IdOrderMapAllocer; typedef common::ObPooledAllocator::AllocType, common::ObWrapperAllocator> JoinPathSetAllocer; typedef common::hash::ObHashMap, common::hash::equal_to, IdOrderMapAllocer, common::hash::NormalPointer, common::ObWrapperAllocator, 2> IdOrderMap; typedef common::hash::ObHashSet, common::hash::equal_to, JoinPathSetAllocer, common::hash::NormalPointer, common::ObWrapperAllocator, 2> JoinPathSet; ObLogPlanHint log_plan_hint_; enum OUTLINE_PRINT_FLAG { ADDED_LEADING_HINT = 1 << 0 }; uint64_t outline_print_flags_; // used print outline common::ObSEArray bushy_tree_infos_; common::ObSEArray onetime_exprs_; // allocated onetime exprs common::ObSEArray function_table_depend_infos_; common::ObSEArray json_table_depend_infos_; common::ObSEArray conflict_detectors_; ObJoinOrder *join_order_; IdOrderMapAllocer id_order_map_allocer_; common::ObWrapperAllocator bucket_allocator_wrapper_; IdOrderMap relid_joinorder_map_; JoinPathSetAllocer join_path_set_allocer_; JoinPathSet join_path_set_; common::ObSEArray recycled_join_paths_; common::ObSEArray pred_sels_; common::ObSEArray multi_stmt_rowkey_pos_; // used as default equal sets/ unique sets for ObLogicalOperator const ObRawExprSets empty_expr_sets_; const ObRelIds empty_table_set_; EqualSets equal_sets_; // non strict equal sets for stmt_; const ObFdItemSet empty_fd_item_set_; // save the maxinum of the logical operator id uint64_t max_op_id_; bool is_subplan_scan_; // 当前plan是否是一个subplan scan bool is_parent_set_distinct_; ObSqlTempTableInfo *temp_table_info_; // current plan is a temp table // 从where condition中抽出的常量表达式 common::ObSEArray const_exprs_; common::ObSEArray hash_dist_info_; // common::ObSEArray column_items_; // add only for error_logging const ObInsertStmt *insert_stmt_; // all basic table meta before base table predicate OptTableMetas basic_table_metas_; // all basic table meta after base table predicate OptTableMetas update_table_metas_; OptSelectivityCtx selectivity_ctx_; ObRelIds subq_pushdown_filter_table_set_; // have been allocated for update table list common::ObSEArray alloc_sfu_list_; struct PartIdExpr { int64_t table_id_; int64_t ref_table_id_; ObRawExpr *calc_part_id_expr_; CalcPartIdType calc_type_; TO_STRING_KV( K_(table_id), K_(ref_table_id), K_(calc_part_id_expr), K_(calc_type) ); }; common::ObSEArray cache_part_id_exprs_; ObRawExprCopier *onetime_copier_; // all onetime expr in current query block common::ObSEArray onetime_query_refs_; common::ObSEArray onetime_params_; common::ObSEArray