23#ifndef SQL_JOIN_OPTIMIZER_ACCESS_PATH_H
24#define SQL_JOIN_OPTIMIZER_ACCESS_PATH_H
520 return u.ref_or_null;
524 return u.ref_or_null;
536 return u.pushed_join_ref;
540 return u.pushed_join_ref;
544 return u.full_text_search;
548 return u.full_text_search;
552 return u.const_table;
556 return u.const_table;
568 return u.follow_tail;
572 return u.follow_tail;
576 return u.index_range_scan;
580 return u.index_range_scan;
584 return u.index_merge;
588 return u.index_merge;
592 return u.rowid_intersection;
596 return u.rowid_intersection;
600 return u.rowid_union;
604 return u.rowid_union;
608 return u.index_skip_scan;
612 return u.index_skip_scan;
616 return u.group_index_skip_scan;
620 return u.group_index_skip_scan;
624 return u.dynamic_index_range_scan;
628 return u.dynamic_index_range_scan;
632 return u.materialized_table_function;
636 return u.materialized_table_function;
640 return u.unqualified_count;
644 return u.unqualified_count;
648 return u.table_value_constructor;
652 return u.table_value_constructor;
656 return u.fake_single_row;
660 return u.fake_single_row;
672 return u.zero_rows_aggregated;
676 return u.zero_rows_aggregated;
696 return u.nested_loop_join;
700 return u.nested_loop_join;
704 return u.nested_loop_semijoin_with_duplicate_removal;
708 return u.nested_loop_semijoin_with_duplicate_removal;
736 return u.temptable_aggregate;
740 return u.temptable_aggregate;
744 return u.limit_offset;
748 return u.limit_offset;
760 return u.materialize;
764 return u.materialize;
768 return u.materialize_information_schema_table;
772 return u.materialize_information_schema_table;
800 return u.remove_duplicates;
804 return u.remove_duplicates;
808 return u.remove_duplicates_on_index;
812 return u.remove_duplicates_on_index;
816 return u.alternative;
820 return u.alternative;
824 return u.cache_invalidator;
828 return u.cache_invalidator;
832 return u.delete_rows;
836 return u.delete_rows;
840 return u.update_rows;
844 return u.update_rows;
1217static_assert(std::is_trivially_destructible<AccessPath>::value,
1218 "AccessPath must be trivially destructible, as it is allocated "
1219 "on the MEM_ROOT and not wrapped in unique_ptr_destroy_only"
1220 "(because multiple candidates during planning could point to "
1221 "the same access paths, and refcounting would be expensive)");
1223 "We are creating a lot of access paths in the join "
1224 "optimizer, so be sure not to bloat it without noticing. "
1225 "(96 bytes for the base, 48 bytes for the variant.)");
1240 bool count_examined_rows) {
1243 path->count_examined_rows = count_examined_rows;
1250 bool count_examined_rows) {
1253 path->count_examined_rows = count_examined_rows;
1255 path->index_scan().idx = idx;
1256 path->index_scan().use_order = use_order;
1263 bool count_examined_rows) {
1266 path->count_examined_rows = count_examined_rows;
1269 path->ref().use_order = use_order;
1276 bool count_examined_rows) {
1279 path->count_examined_rows = count_examined_rows;
1281 path->ref_or_null().ref =
ref;
1282 path->ref_or_null().use_order = use_order;
1287 bool count_examined_rows) {
1290 path->count_examined_rows = count_examined_rows;
1299 bool count_examined_rows) {
1302 path->count_examined_rows = count_examined_rows;
1304 path->pushed_join_ref().ref =
ref;
1305 path->pushed_join_ref().use_order = use_order;
1306 path->pushed_join_ref().is_unique = is_unique;
1313 bool use_order,
bool use_limit,
1314 bool count_examined_rows) {
1317 path->count_examined_rows = count_examined_rows;
1319 path->full_text_search().ref =
ref;
1320 path->full_text_search().use_order = use_order;
1321 path->full_text_search().use_limit = use_limit;
1322 path->full_text_search().ft_func = ft_func;
1328 bool count_examined_rows) {
1331 path->count_examined_rows = count_examined_rows;
1332 path->set_num_output_rows(1.0);
1334 path->init_cost = 0.0;
1335 path->init_once_cost = 0.0;
1337 path->const_table().ref =
ref;
1347 path->mrr().mrr_flags = mrr_flags;
1350 path->mrr().bka_path =
nullptr;
1356 bool count_examined_rows) {
1359 path->count_examined_rows = count_examined_rows;
1368 path->count_examined_rows = count_examined_rows;
1369 path->dynamic_index_range_scan().table =
table;
1370 path->dynamic_index_range_scan().qep_tab = qep_tab;
1379 path->materialized_table_function().table =
table;
1380 path->materialized_table_function().table_function = table_function;
1381 path->materialized_table_function().table_path = table_path;
1396 path->count_examined_rows =
true;
1402 KEY *
key,
size_t key_len) {
1405 path->nested_loop_semijoin_with_duplicate_removal().outer = outer;
1406 path->nested_loop_semijoin_with_duplicate_removal().inner = inner;
1407 path->nested_loop_semijoin_with_duplicate_removal().table =
table;
1408 path->nested_loop_semijoin_with_duplicate_removal().key =
key;
1409 path->nested_loop_semijoin_with_duplicate_removal().key_len = key_len;
1417 path->filter().child = child;
1418 path->filter().condition = condition;
1419 path->filter().materialize_subqueries =
false;
1426 ORDER *order,
bool count_examined_rows);
1432 path->aggregate().child = child;
1433 path->aggregate().rollup = rollup;
1442 path->temptable_aggregate().subquery_path = subquery_path;
1443 path->temptable_aggregate().temp_table_param = temp_table_param;
1444 path->temptable_aggregate().table =
table;
1445 path->temptable_aggregate().table_path = table_path;
1446 path->temptable_aggregate().ref_slice = ref_slice;
1452 bool count_all_rows,
1453 bool reject_multiple_rows,
1454 ha_rows *send_records_override) {
1458 path->immediate_update_delete_table = child->immediate_update_delete_table;
1459 path->limit_offset().child = child;
1460 path->limit_offset().limit = limit;
1461 path->limit_offset().offset = offset;
1462 path->limit_offset().count_all_rows = count_all_rows;
1463 path->limit_offset().reject_multiple_rows = reject_multiple_rows;
1464 path->limit_offset().send_records_override = send_records_override;
1465 path->ordering_state = child->ordering_state;
1471 bool count_examined_rows) {
1474 path->count_examined_rows = count_examined_rows;
1475 path->set_num_output_rows(1.0);
1477 path->init_cost = 0.0;
1478 path->init_once_cost = 0.0;
1483 const char *cause) {
1486 path->zero_rows().child = child;
1487 path->zero_rows().cause = cause;
1488 path->set_num_output_rows(0.0);
1490 path->init_cost = 0.0;
1491 path->init_once_cost = 0.0;
1492 path->num_output_rows_before_filter = 0.0;
1493 path->cost_before_filter = 0.0;
1502 const char *cause) {
1505 path->zero_rows_aggregated().cause = cause;
1506 path->set_num_output_rows(1.0);
1508 path->init_cost = 0.0;
1518 path->stream().child = child;
1520 path->stream().temp_table_param = temp_table_param;
1522 path->stream().ref_slice = ref_slice;
1524 path->stream().provide_rowid =
false;
1532 assert(
path !=
nullptr);
1548 int ref_slice,
bool rematerialize,
ha_rows limit_rows,
1549 bool reject_multiple_rows) {
1553 if (rematerialize) {
1581 path->materialize().table_path = table_path;
1582 path->materialize().param = param;
1583 path->materialize().subquery_cost = -1.0;
1584 if (rematerialize) {
1597 path->materialize_information_schema_table().table_path = table_path;
1598 path->materialize_information_schema_table().table_list = table_list;
1599 path->materialize_information_schema_table().condition = condition;
1609 path->append().children = children;
1611 path->init_cost = 0.0;
1612 path->init_once_cost = 0.0;
1613 double num_output_rows = 0.0;
1615 path->cost += child.path->cost;
1616 path->init_cost += child.path->init_cost;
1617 path->init_once_cost += child.path->init_once_cost;
1618 num_output_rows += child.path->num_output_rows();
1620 path->set_num_output_rows(num_output_rows);
1627 int ref_slice,
bool needs_buffering) {
1630 path->window().child = child;
1631 path->window().window = window;
1632 path->window().temp_table =
nullptr;
1633 path->window().temp_table_param = temp_table_param;
1634 path->window().ref_slice = ref_slice;
1635 path->window().needs_buffering = needs_buffering;
1643 path->weedout().child = child;
1644 path->weedout().weedout_table = weedout_table;
1645 path->weedout().tables_to_get_rowid_for =
1652 int group_items_size) {
1655 path->remove_duplicates().child = child;
1656 path->remove_duplicates().group_items = group_items;
1657 path->remove_duplicates().group_items_size = group_items_size;
1663 unsigned loosescan_key_len) {
1666 path->remove_duplicates_on_index().child = child;
1667 path->remove_duplicates_on_index().table =
table;
1668 path->remove_duplicates_on_index().key =
key;
1669 path->remove_duplicates_on_index().loosescan_key_len = loosescan_key_len;
1678 path->alternative().table_scan_path = table_scan_path;
1679 path->alternative().child = child;
1680 path->alternative().used_ref = used_ref;
1688 path->cache_invalidator().child = child;
1689 path->cache_invalidator().name =
name;
1709 bool eligible_for_batch_mode);
1717 eligible_for_batch_mode);
1721 const POSITION *pos,
bool is_after_filter,
1768 unsigned num_where_predicates);
1776 int num_where_predicates);
1782 unsigned num_where_predicates);
1804 const std::vector<HashJoinCondition> &equijoin_conditions,
AccessPath * NewStreamingAccessPath(THD *thd, AccessPath *child, JOIN *join, Temp_table_param *temp_table_param, TABLE *table, int ref_slice)
Definition: access_path.h:1512
AccessPath * NewRemoveDuplicatesAccessPath(THD *thd, AccessPath *child, Item **group_items, int group_items_size)
Definition: access_path.h:1650
AccessPath * NewInvalidatorAccessPath(THD *thd, AccessPath *child, const char *name)
Definition: access_path.h:1684
AccessPath * NewRefAccessPath(THD *thd, TABLE *table, Index_lookup *ref, bool use_order, bool reverse, bool count_examined_rows)
Definition: access_path.h:1261
AccessPath * NewDeleteRowsAccessPath(THD *thd, AccessPath *child, table_map delete_tables, table_map immediate_tables)
Definition: access_path.cc:102
void CopyBasicProperties(const AccessPath &from, AccessPath *to)
Definition: access_path.h:1227
void ExpandSingleFilterAccessPath(THD *thd, AccessPath *path, const JOIN *join, const Mem_root_array< Predicate > &predicates, unsigned num_where_predicates)
Like ExpandFilterAccessPaths(), but expands only the single access path at “path”.
Definition: access_path.cc:1426
AccessPath * NewFullTextSearchAccessPath(THD *thd, TABLE *table, Index_lookup *ref, Item_func_match *ft_func, bool use_order, bool use_limit, bool count_examined_rows)
Definition: access_path.h:1310
AccessPath * NewTemptableAggregateAccessPath(THD *thd, AccessPath *subquery_path, Temp_table_param *temp_table_param, TABLE *table, AccessPath *table_path, int ref_slice)
Definition: access_path.h:1437
table_map GetHashJoinTables(AccessPath *path)
Returns the tables that are part of a hash join.
Definition: access_path.cc:1550
AccessPath * NewDynamicIndexRangeScanAccessPath(THD *thd, TABLE *table, QEP_TAB *qep_tab, bool count_examined_rows)
Definition: access_path.h:1364
AccessPath * NewZeroRowsAggregatedAccessPath(THD *thd, const char *cause)
Definition: access_path.h:1501
AccessPath * NewAlternativeAccessPath(THD *thd, AccessPath *child, AccessPath *table_scan_path, Index_lookup *used_ref)
Definition: access_path.h:1673
AccessPath * NewUpdateRowsAccessPath(THD *thd, AccessPath *child, table_map delete_tables, table_map immediate_tables)
Definition: access_path.cc:114
AccessPath * NewMRRAccessPath(THD *thd, TABLE *table, Index_lookup *ref, int mrr_flags)
Definition: access_path.h:1341
table_map GetUsedTableMap(const AccessPath *path, bool include_pruned_tables)
Returns a map of all tables read when path or any of its children are executed.
Definition: access_path.cc:216
AccessPath * NewAppendAccessPath(THD *thd, Mem_root_array< AppendPathParameters > *children)
Definition: access_path.h:1605
AccessPath * NewNestedLoopSemiJoinWithDuplicateRemovalAccessPath(THD *thd, AccessPath *outer, AccessPath *inner, const TABLE *table, KEY *key, size_t key_len)
Definition: access_path.h:1400
AccessPath * NewRemoveDuplicatesOnIndexAccessPath(THD *thd, AccessPath *child, TABLE *table, KEY *key, unsigned loosescan_key_len)
Definition: access_path.h:1661
AccessPath * NewFakeSingleRowAccessPath(THD *thd, bool count_examined_rows)
Definition: access_path.h:1470
Item * ConditionFromFilterPredicates(const Mem_root_array< Predicate > &predicates, OverflowBitset mask, int num_where_predicates)
Extracts the Item expression from the given “filter_predicates” corresponding to the given “mask”.
Definition: access_path.cc:1415
AccessPath * NewFilterAccessPath(THD *thd, AccessPath *child, Item *condition)
Definition: access_path.h:1413
constexpr double kUnknownRowCount
To indicate that a row estimate is not yet made.
Definition: access_path.h:169
AccessPath * NewSortAccessPath(THD *thd, AccessPath *child, Filesort *filesort, ORDER *order, bool count_examined_rows)
Definition: access_path.cc:67
AccessPath * NewMaterializedTableFunctionAccessPath(THD *thd, TABLE *table, Table_function *table_function, AccessPath *table_path)
Definition: access_path.h:1374
AccessPath * NewMaterializeAccessPath(THD *thd, Mem_root_array< MaterializePathParameters::Operand > operands, Mem_root_array< const AccessPath * > *invalidators, TABLE *table, AccessPath *table_path, Common_table_expr *cte, Query_expression *unit, int ref_slice, bool rematerialize, ha_rows limit_rows, bool reject_multiple_rows)
Definition: access_path.h:1544
const Mem_root_array< Item * > * GetExtraHashJoinConditions(MEM_ROOT *mem_root, bool using_hypergraph_optimizer, const std::vector< HashJoinCondition > &equijoin_conditions, const Mem_root_array< Item * > &other_conditions)
Get the conditions to put into the extra conditions of the HashJoinIterator.
Mem_root_array< TABLE * > CollectTables(THD *thd, AccessPath *root_path)
Find the list of all tables used by this root, stopping at materializations.
Definition: access_path.cc:247
AccessPath * NewTableScanAccessPath(THD *thd, TABLE *table, bool count_examined_rows)
Definition: access_path.h:1239
void ExpandFilterAccessPaths(THD *thd, AccessPath *path, const JOIN *join, const Mem_root_array< Predicate > &predicates, unsigned num_where_predicates)
For each access path in the (sub)tree rooted at “path”, expand any use of “filter_predicates” into ne...
Definition: access_path.cc:1538
AccessPath * NewMaterializeInformationSchemaTableAccessPath(THD *thd, AccessPath *table_path, Table_ref *table_list, Item *condition)
Definition: access_path.h:1593
void FindTablesToGetRowidFor(AccessPath *path)
Modifies "path" and the paths below it so that they provide row IDs for all tables.
Definition: access_path.cc:1271
AccessPath * NewAggregateAccessPath(THD *thd, AccessPath *child, bool rollup)
Definition: access_path.h:1428
TABLE * GetBasicTable(const AccessPath *path)
Return the TABLE* referred from 'path' if it is a basic access path, else a nullptr is returned.
Definition: access_path.cc:163
AccessPath * NewRefOrNullAccessPath(THD *thd, TABLE *table, Index_lookup *ref, bool use_order, bool count_examined_rows)
Definition: access_path.h:1274
AccessPath * NewLimitOffsetAccessPath(THD *thd, AccessPath *child, ha_rows limit, ha_rows offset, bool count_all_rows, bool reject_multiple_rows, ha_rows *send_records_override)
Definition: access_path.h:1450
AccessPath * NewEQRefAccessPath(THD *thd, TABLE *table, Index_lookup *ref, bool count_examined_rows)
Definition: access_path.h:1286
AccessPath * NewWindowAccessPath(THD *thd, AccessPath *child, Window *window, Temp_table_param *temp_table_param, int ref_slice, bool needs_buffering)
Definition: access_path.h:1624
AccessPath * NewFollowTailAccessPath(THD *thd, TABLE *table, bool count_examined_rows)
Definition: access_path.h:1355
AccessPath * NewTableValueConstructorAccessPath(THD *thd)
Definition: access_path.h:1391
AccessPath * NewConstTableAccessPath(THD *thd, TABLE *table, Index_lookup *ref, bool count_examined_rows)
Definition: access_path.h:1326
unique_ptr_destroy_only< RowIterator > CreateIteratorFromAccessPath(THD *thd, MEM_ROOT *mem_root, AccessPath *path, JOIN *join, bool eligible_for_batch_mode)
Definition: access_path.cc:431
AccessPath * NewWeedoutAccessPath(THD *thd, AccessPath *child, SJ_TMP_TABLE *weedout_table)
Definition: access_path.h:1639
AccessPath * NewPushedJoinRefAccessPath(THD *thd, TABLE *table, Index_lookup *ref, bool use_order, bool is_unique, bool count_examined_rows)
Definition: access_path.h:1296
AccessPath * NewZeroRowsAccessPath(THD *thd, AccessPath *child, const char *cause)
Definition: access_path.h:1482
AccessPath * NewUnqualifiedCountAccessPath(THD *thd)
Definition: access_path.h:1385
AccessPath * NewIndexScanAccessPath(THD *thd, TABLE *table, int idx, bool use_order, bool reverse, bool count_examined_rows)
Definition: access_path.h:1248
Mem_root_array< MaterializePathParameters::Operand > SingleMaterializeQueryBlock(THD *thd, AccessPath *path, int select_number, JOIN *join, bool copy_items, Temp_table_param *temp_table_param)
Definition: access_path.h:1529
A wrapper class which provides array bounds checking.
Definition: sql_array.h:46
After parsing, a Common Table Expression is accessed through a Table_ref.
Definition: table.h:4383
API for getting cost estimates for server operations that are not directly related to a table object.
Definition: opt_costmodel.h:53
Sorting related info.
Definition: filesort.h:51
A class that represents a join condition in a hash join.
Definition: item_cmpfunc.h:86
Definition: item_func.h:3420
Base class that is used to represent any kind of expression in a relational query.
Definition: item.h:932
Definition: sql_optimizer.h:132
A typesafe replacement for DYNAMIC_ARRAY.
Definition: mem_root_array.h:425
Definition: overflow_bitset.h:76
Definition: sql_executor.h:261
Definition: range_optimizer.h:68
This class represents a query expression (one query block or several query blocks combined with UNION...
Definition: sql_lex.h:624
A context for reading through a single table using a chosen access method: index read,...
Definition: row_iterator.h:81
Definition: sql_executor.h:103
For each client connection we create a separate thread with THD serving as a thread/connection descri...
Definition: sql_lexer_thd.h:35
MEM_ROOT * mem_root
Definition: sql_lexer_thd.h:39
Class representing a table function.
Definition: table_function.h:52
Object containing parameters used when creating and using temporary tables.
Definition: temp_table_param.h:94
Represents the (explicit) window of a SQL 2003 section 7.11 <window clause>, or the implicit (inlined...
Definition: window.h:104
static MEM_ROOT mem_root
Definition: client_plugin.cc:113
void EstimateLimitOffsetCost(AccessPath *path)
Estimate the costs and row count for a LIMIT_OFFSET AccessPath.
Definition: cost_model.cc:916
bool filesort(THD *thd, Filesort *filesort, RowIterator *source_iterator, table_map tables_to_get_rowid_for, ha_rows num_rows_estimate, Filesort_info *fs_info, Sort_result *sort_result, ha_rows *found_rows)
Sort a table.
Definition: filesort.cc:366
void SetCostOnTableAccessPath(const Cost_model_server &cost_model, const POSITION *pos, bool is_after_filter, AccessPath *path)
Definition: sql_executor.cc:1851
std::bitset< kMaxSupportedFDs > FunctionalDependencySet
Definition: interesting_orders_defs.h:62
JoinType
Definition: join_type.h:27
static mi_bit_type mask[]
Definition: mi_packrec.cc:140
std::unique_ptr< T, Destroy_only< T > > unique_ptr_destroy_only
std::unique_ptr, but only destroying.
Definition: my_alloc.h:488
my_off_t ha_rows
Definition: my_base.h:1139
#define HA_POS_ERROR
Definition: my_base.h:1141
uint64_t table_map
Definition: my_table_map.h:29
static char * path
Definition: mysqldump.cc:148
static PFS_engine_table_share_proxy table
Definition: pfs.cc:60
PT & ref(PT *tp)
Definition: tablespace_impl.cc:358
uint64_t NodeMap
Since our graphs can never have more than 61 tables, node sets and edge lists are implemented using 6...
Definition: node_map.h:39
RangeReverse< Range > reverse(Range &x)
Iterate over a range in reverse.
Definition: utilities.h:131
std::string join(Container cont, const std::string &delim)
join elements of an container into a string separated by a delimiter.
Definition: string.h:150
int delete_tables(PFS_engine_table_share_proxy **, unsigned int) noexcept
Definition: pfs_plugin_table_v1_all_empty.cc:38
OverflowBitset is a fixed-size (once allocated) bitmap that is optimized for the common case of few e...
required string key
Definition: replication_asynchronous_connection_failover.proto:59
case opt name
Definition: sslopt-case.h:32
Access paths are a query planning structure that correspond 1:1 to iterators, in that an access path ...
Definition: access_path.h:193
auto & weedout()
Definition: access_path.h:790
auto & filter()
Definition: access_path.h:710
bool count_all_rows
Definition: access_path.h:1136
AccessPath * bka_path
Definition: access_path.h:906
struct AccessPath::@60::@92 limit_offset
auto & ref_or_null()
Definition: access_path.h:518
auto & materialized_table_function()
Definition: access_path.h:630
AccessPath * cpk_child
Definition: access_path.h:967
auto & rowid_union()
Definition: access_path.h:598
double cost_before_filter
Definition: access_path.h:396
hypergraph::NodeMap parameter_tables
If nonzero, a bitmap of other tables whose joined-in rows must already be loaded when rows from this ...
Definition: access_path.h:482
const auto & bka_join() const
Definition: access_path.h:690
struct AccessPath::@60::@68 const_table
TABLE * temp_table
Definition: access_path.h:1173
OverflowBitset equijoin_predicates
Definition: access_path.h:1077
Item ** group_items
Definition: access_path.h:1185
double rescan_cost() const
Return the cost of scanning the given path for the second time (or later) in the given query block.
Definition: access_path.h:391
bool rollup
Definition: access_path.h:1123
auto & materialize()
Definition: access_path.h:758
struct AccessPath::@60::@90 aggregate
const auto & temptable_aggregate() const
Definition: access_path.h:738
OverflowBitset & subsumed_sargable_join_predicates()
Similar to applied_sargable_join_predicates, bitmap of sargable join predicates that have been applie...
Definition: access_path.h:454
auto & index_scan()
Definition: access_path.h:502
struct AccessPath::@60::@67 full_text_search
struct AccessPath::@60::@94 materialize
const auto & delete_rows() const
Definition: access_path.h:834
struct AccessPath::@60::@95 materialize_information_schema_table
const auto & filter() const
Definition: access_path.h:714
struct AccessPath::@60::@73 rowid_intersection
auto & delete_rows()
Definition: access_path.h:830
bool reuse_handler
Definition: access_path.h:944
KEY_PART * used_key_part
Definition: access_path.h:918
struct AccessPath::@60::@69 mrr
struct AccessPath::@60::@75 index_skip_scan
OverflowBitset & applied_sargable_join_predicates()
Bitmap of sargable join predicates that have already been applied in this access path by means of an ...
Definition: access_path.h:434
Item * condition
Definition: access_path.h:1095
const auto & index_merge() const
Definition: access_path.h:586
const auto & update_rows() const
Definition: access_path.h:842
enum AccessPath::Type type
auto & alternative()
Definition: access_path.h:814
auto & pushed_join_ref()
Definition: access_path.h:534
struct AccessPath::@60::@87 nested_loop_semijoin_with_duplicate_removal
AccessPath * outer
Definition: access_path.h:1051
auto & index_skip_scan()
Definition: access_path.h:606
bool rewrite_semi_to_inner
Definition: access_path.h:1055
const auto & zero_rows_aggregated() const
Definition: access_path.h:674
auto & group_index_skip_scan()
Definition: access_path.h:614
const auto & eq_ref() const
Definition: access_path.h:530
int group_items_size
Definition: access_path.h:1186
bool use_order
Definition: access_path.h:868
struct AccessPath::@60::@93 stream
struct AccessPath::@60::@101 alternative
bool pfs_batch_mode
Definition: access_path.h:1069
auto & temptable_aggregate()
Definition: access_path.h:734
AccessPath()
Definition: access_path.h:199
GroupIndexSkipScanParameters * param
Definition: access_path.h:1011
auto & rowid_intersection()
Definition: access_path.h:590
bool materialize_subqueries
Definition: access_path.h:1105
struct AccessPath::@60::@76 group_index_skip_scan
AccessPath * child
Definition: access_path.h:1039
bool allow_spill_to_disk
Definition: access_path.h:1053
struct AccessPath::@60::@61 table_scan
Index_lookup * used_ref
Definition: access_path.h:1199
auto & mrr()
Definition: access_path.h:558
const auto & index_scan() const
Definition: access_path.h:506
const auto & fake_single_row() const
Definition: access_path.h:658
bool reject_multiple_rows
Definition: access_path.h:1137
bool allow_clustered_primary_key_scan
Definition: access_path.h:959
const char * name
Definition: access_path.h:1203
bool use_limit
Definition: access_path.h:896
Window * window
Definition: access_path.h:1172
table_map tables_to_get_rowid_for
Definition: access_path.h:1056
auto & materialize_information_schema_table()
Definition: access_path.h:766
struct AccessPath::@60::@70 follow_tail
auto & bka_join()
Definition: access_path.h:686
const auto & follow_tail() const
Definition: access_path.h:570
SJ_TMP_TABLE * weedout_table
Definition: access_path.h:1180
Index_lookup * ref
Definition: access_path.h:873
const auto & window() const
Definition: access_path.h:786
struct AccessPath::@60::@65 eq_ref
const auto & materialized_table_function() const
Definition: access_path.h:634
struct AccessPath::@60::@103 delete_rows
auto & unqualified_count()
Definition: access_path.h:638
bool keep_current_rowid
Definition: access_path.h:908
bool using_extended_key_parts
Definition: access_path.h:954
auto & nested_loop_join()
Definition: access_path.h:694
const auto & full_text_search() const
Definition: access_path.h:546
struct AccessPath::@60::@91 temptable_aggregate
bool can_be_used_for_ror
Definition: access_path.h:934
float rec_per_key
Definition: access_path.h:1062
Safety safe_for_rowid
Whether it is safe to get row IDs (for sorting) from this access path.
Definition: access_path.h:292
struct AccessPath::@60::@71 index_range_scan
JOIN * join
Definition: access_path.h:1144
unsigned index
Definition: access_path.h:930
unsigned mrr_buf_size
Definition: access_path.h:926
struct AccessPath::@60::@78 materialized_table_function
auto & remove_duplicates()
Definition: access_path.h:798
struct AccessPath::@60::@79 unqualified_count
struct AccessPath::@60::@72 index_merge
RowIterator * iterator
If an iterator has been instantiated for this access path, points to the iterator.
Definition: access_path.h:359
const auto & stream() const
Definition: access_path.h:754
double init_cost
Expected cost to initialize this access path; ie., cost to read k out of N rows would be init_cost + ...
Definition: access_path.h:371
const auto & remove_duplicates() const
Definition: access_path.h:802
auto & window()
Definition: access_path.h:782
bool need_rows_in_rowid_order
Definition: access_path.h:938
Table_ref * table_list
Definition: access_path.h:1164
const auto & unqualified_count() const
Definition: access_path.h:642
void * secondary_engine_data
Auxiliary data used by a secondary storage engine while processing the access path during optimizatio...
Definition: access_path.h:491
struct AccessPath::@60::@83 zero_rows_aggregated
void set_num_output_rows(double val)
Definition: access_path.h:849
struct AccessPath::@60::@74 rowid_union
bool is_covering
Definition: access_path.h:987
struct AccessPath::@60::@81 fake_single_row
const auto & mrr() const
Definition: access_path.h:562
bool remove_duplicates
Definition: access_path.h:1117
table_map tables_to_update
Definition: access_path.h:1212
const auto & table_value_constructor() const
Definition: access_path.h:650
KEY * key
Definition: access_path.h:1089
auto & table_value_constructor()
Definition: access_path.h:646
auto & stream()
Definition: access_path.h:750
size_t key_len
Definition: access_path.h:1090
const OverflowBitset & subsumed_sargable_join_predicates() const
Definition: access_path.h:457
struct AccessPath::@60::@85 bka_join
const auto & zero_rows() const
Definition: access_path.h:666
const auto & append() const
Definition: access_path.h:778
ha_rows offset
Definition: access_path.h:1135
int idx
Definition: access_path.h:867
auto & hash_join()
Definition: access_path.h:678
auto & cache_invalidator()
Definition: access_path.h:822
struct AccessPath::@60::@84 hash_join
bool force_sort_rowids
Definition: access_path.h:1119
unsigned num_used_key_parts
Definition: access_path.h:931
unsigned num_ranges
Definition: access_path.h:923
ORDER * order
Definition: access_path.h:1115
auto & sort()
Definition: access_path.h:718
auto & fake_single_row()
Definition: access_path.h:654
ha_rows limit
Definition: access_path.h:1116
auto & follow_tail()
Definition: access_path.h:566
struct AccessPath::@60::@100 remove_duplicates_on_index
double m_num_output_rows
Expected number of output rows, -1.0 for unknown.
Definition: access_path.h:853
const JoinPredicate * join_predicate
Definition: access_path.h:1052
struct AccessPath::@60::@80 table_value_constructor
const auto & const_table() const
Definition: access_path.h:554
const auto & dynamic_index_range_scan() const
Definition: access_path.h:626
const auto & table_scan() const
Definition: access_path.h:498
unsigned mrr_flags
Definition: access_path.h:925
int ref_slice
Definition: access_path.h:1130
OverflowBitset filter_predicates
Bitmap of WHERE predicates that we are including on this access path, referring to the “predicates” a...
Definition: access_path.h:418
bool can_be_used_for_imerge
Definition: access_path.h:941
bool forced_by_hint
Definition: access_path.h:958
auto & limit_offset()
Definition: access_path.h:742
AccessPath * inner
Definition: access_path.h:1051
bool provide_rowid
Definition: access_path.h:1147
const auto & index_range_scan() const
Definition: access_path.h:578
const auto & ref() const
Definition: access_path.h:514
bool forced_by_dbug
Whether this access path is forced preferred over all others by means of a SET DEBUG force_subplan_0x...
Definition: access_path.h:303
Item_func_match * ft_func
Definition: access_path.h:897
ha_rows * send_records_override
Definition: access_path.h:1140
auto & table_scan()
Definition: access_path.h:494
const auto & hash_join() const
Definition: access_path.h:682
QEP_TAB * qep_tab
Definition: access_path.h:1015
Table_function * table_function
Definition: access_path.h:1019
auto & zero_rows_aggregated()
Definition: access_path.h:670
const auto & sort() const
Definition: access_path.h:722
bool unwrap_rollup
Definition: access_path.h:1118
double init_once_cost
Of init_cost, how much of the initialization needs only to be done once per query block.
Definition: access_path.h:383
struct AccessPath::@60::@64 ref_or_null
Type
Definition: access_path.h:208
@ FOLLOW_TAIL
Definition: access_path.h:221
@ FILTER
Definition: access_path.h:245
@ PUSHED_JOIN_REF
Definition: access_path.h:217
@ ZERO_ROWS_AGGREGATED
Definition: access_path.h:234
@ UPDATE_ROWS
Definition: access_path.h:263
@ AGGREGATE
Definition: access_path.h:247
@ BKA_JOIN
Definition: access_path.h:241
@ ZERO_ROWS
Definition: access_path.h:233
@ CONST_TABLE
Definition: access_path.h:219
@ GROUP_INDEX_SKIP_SCAN
Definition: access_path.h:227
@ INDEX_RANGE_SCAN
Definition: access_path.h:222
@ UNQUALIFIED_COUNT
Definition: access_path.h:236
@ EQ_REF
Definition: access_path.h:216
@ FAKE_SINGLE_ROW
Definition: access_path.h:232
@ MATERIALIZE_INFORMATION_SCHEMA_TABLE
Definition: access_path.h:252
@ WINDOW
Definition: access_path.h:254
@ REF_OR_NULL
Definition: access_path.h:215
@ MATERIALIZE
Definition: access_path.h:251
@ NESTED_LOOP_SEMIJOIN_WITH_DUPLICATE_REMOVAL
Definition: access_path.h:240
@ ROWID_UNION
Definition: access_path.h:225
@ INDEX_SKIP_SCAN
Definition: access_path.h:226
@ MRR
Definition: access_path.h:220
@ CACHE_INVALIDATOR
Definition: access_path.h:259
@ INDEX_SCAN
Definition: access_path.h:213
@ TABLE_VALUE_CONSTRUCTOR
Definition: access_path.h:231
@ WEEDOUT
Definition: access_path.h:255
@ MATERIALIZED_TABLE_FUNCTION
Definition: access_path.h:235
@ REMOVE_DUPLICATES_ON_INDEX
Definition: access_path.h:257
@ TABLE_SCAN
Definition: access_path.h:212
@ REF
Definition: access_path.h:214
@ TEMPTABLE_AGGREGATE
Definition: access_path.h:248
@ LIMIT_OFFSET
Definition: access_path.h:249
@ APPEND
Definition: access_path.h:253
@ NESTED_LOOP_JOIN
Definition: access_path.h:239
@ INDEX_MERGE
Definition: access_path.h:223
@ FULL_TEXT_SEARCH
Definition: access_path.h:218
@ ALTERNATIVE
Definition: access_path.h:258
@ STREAM
Definition: access_path.h:250
@ REMOVE_DUPLICATES
Definition: access_path.h:256
@ ROWID_INTERSECTION
Definition: access_path.h:224
@ DYNAMIC_INDEX_RANGE_SCAN
Definition: access_path.h:228
@ DELETE_ROWS
Definition: access_path.h:262
@ SORT
Definition: access_path.h:246
@ HASH_JOIN
Definition: access_path.h:242
bool retrieve_full_rows
Definition: access_path.h:970
const auto & rowid_union() const
Definition: access_path.h:602
const TABLE * table
Definition: access_path.h:1088
struct AccessPath::@60::@89 sort
const auto & index_skip_scan() const
Definition: access_path.h:610
auto & dynamic_index_range_scan()
Definition: access_path.h:622
const auto & pushed_join_ref() const
Definition: access_path.h:538
auto & remove_duplicates_on_index()
Definition: access_path.h:806
table_map immediate_tables
Definition: access_path.h:1208
int mrr_flags
Definition: access_path.h:907
struct AccessPath::@60::@77 dynamic_index_range_scan
struct AccessPath::@60::@62 index_scan
auto & full_text_search()
Definition: access_path.h:542
const auto & materialize() const
Definition: access_path.h:762
int ordering_state
Which ordering the rows produced by this path follow, if any (see interesting_orders....
Definition: access_path.h:353
auto & eq_ref()
Definition: access_path.h:526
JoinType join_type
Definition: access_path.h:1060
const auto & limit_offset() const
Definition: access_path.h:746
MaterializePathParameters * param
Definition: access_path.h:1158
const char * cause
Definition: access_path.h:1042
auto & update_rows()
Definition: access_path.h:838
auto & index_merge()
Definition: access_path.h:582
auto & aggregate()
Definition: access_path.h:726
struct AccessPath::@60::@102 cache_invalidator
struct AccessPath::@60::@104 update_rows
struct AccessPath::@60::@82 zero_rows
const auto & group_index_skip_scan() const
Definition: access_path.h:618
auto & zero_rows()
Definition: access_path.h:662
AccessPath * subquery_path
Definition: access_path.h:1126
Mem_root_array< AppendPathParameters > * children
Definition: access_path.h:1168
double cost
Expected cost to read all of this access path once; -1.0 for unknown.
Definition: access_path.h:362
const auto & nested_loop_join() const
Definition: access_path.h:698
bool already_expanded_predicates
Definition: access_path.h:1070
const auto & remove_duplicates_on_index() const
Definition: access_path.h:810
struct AccessPath::@60::@86 nested_loop_join
Temp_table_param * temp_table_param
Definition: access_path.h:1127
auto & nested_loop_semijoin_with_duplicate_removal()
Definition: access_path.h:702
bool reverse
Definition: access_path.h:869
AccessPath * table_scan_path
Definition: access_path.h:1195
const auto & materialize_information_schema_table() const
Definition: access_path.h:770
double subquery_cost
The total cost of executing the queries that we materialize.
Definition: access_path.h:1160
bool geometry
Definition: access_path.h:947
bool count_examined_rows
Whether this access path counts as one that scans a base table, and thus should be counted towards ex...
Definition: access_path.h:298
unsigned loosescan_key_len
Definition: access_path.h:1192
auto & ref()
Definition: access_path.h:510
table_map tables_to_delete_from
Definition: access_path.h:1207
IndexSkipScanParameters * param
Definition: access_path.h:1002
const OverflowBitset & applied_sargable_join_predicates() const
Definition: access_path.h:437
Mem_root_array< AccessPath * > * children
Definition: access_path.h:960
OverflowBitset delayed_predicates
Bitmap of WHERE predicates that touch tables we have joined in, but that we could not apply yet (for ...
Definition: access_path.h:446
AccessPath * table_path
Definition: access_path.h:1020
const auto & aggregate() const
Definition: access_path.h:730
struct AccessPath::@60::@96 append
TABLE * table
Definition: access_path.h:863
auto & append()
Definition: access_path.h:774
const auto & weedout() const
Definition: access_path.h:794
const auto & cache_invalidator() const
Definition: access_path.h:826
bool needs_buffering
Definition: access_path.h:1176
int8_t immediate_update_delete_table
For UPDATE and DELETE statements: The node index of a table which can be updated or deleted from imme...
Definition: access_path.h:347
QUICK_RANGE ** ranges
Definition: access_path.h:922
bool is_unique
Definition: access_path.h:890
struct AccessPath::@60::@66 pushed_join_ref
const auto & alternative() const
Definition: access_path.h:818
Safety
A general enum to describe the safety of a given operation.
Definition: access_path.h:273
@ SAFE_IF_SCANNED_ONCE
The given operation is safe if this access path is scanned once, but not if it's scanned multiple tim...
Definition: access_path.h:282
@ UNSAFE
The given operation is unsafe on this access path, no matter how many or few times it's scanned.
Definition: access_path.h:288
@ SAFE
The given operation is always safe on this access path.
Definition: access_path.h:275
struct AccessPath::@60::@98 weedout
auto & const_table()
Definition: access_path.h:550
unsigned mrr_length_per_rec
Definition: access_path.h:1061
struct AccessPath::@60::@88 filter
const auto & rowid_intersection() const
Definition: access_path.h:594
auto & index_range_scan()
Definition: access_path.h:574
double num_output_rows() const
Definition: access_path.h:847
double num_output_rows_before_filter
If no filter, identical to num_output_rows, cost, respectively.
Definition: access_path.h:395
const auto & ref_or_null() const
Definition: access_path.h:522
Filesort * filesort
Definition: access_path.h:1109
bool store_rowids
Definition: access_path.h:1054
const auto & nested_loop_semijoin_with_duplicate_removal() const
Definition: access_path.h:706
Definition: access_path.h:163
JOIN * join
Definition: access_path.h:165
AccessPath * path
Definition: access_path.h:164
Definition: group_index_skip_scan_plan.h:44
Logically a part of AccessPath::index_skip_scan(), but is too large, so split out into its own struct...
Definition: index_skip_scan_plan.h:72
Structure used for index-based lookups.
Definition: sql_opt_exec_shared.h:66
A specification that two specific relational expressions (e.g., two tables, or a table and a join bet...
Definition: access_path.h:76
int semijoin_group_size
Definition: access_path.h:109
FunctionalDependencySet functional_dependencies
Definition: access_path.h:93
Mem_root_array< int > functional_dependencies_idx
Definition: access_path.h:98
RelationalExpression * expr
Definition: access_path.h:77
double selectivity
Definition: access_path.h:78
int ordering_idx_needed_for_semijoin_rewrite
Definition: access_path.h:103
Item ** semijoin_group
Definition: access_path.h:108
size_t estimated_bytes_per_row
Definition: access_path.h:82
Definition: range_optimizer.h:54
The MEM_ROOT is a simple arena, where allocations are carved out of larger blocks.
Definition: my_alloc.h:82
Definition: materialize_path_parameters.h:41
AccessPath * subquery_path
Definition: materialize_path_parameters.h:42
int select_number
Definition: materialize_path_parameters.h:43
JOIN * join
Definition: materialize_path_parameters.h:44
bool copy_items
Definition: materialize_path_parameters.h:46
Temp_table_param * temp_table_param
Definition: materialize_path_parameters.h:47
bool disable_deduplication_by_hash_field
Definition: materialize_path_parameters.h:45
Definition: materialize_path_parameters.h:39
bool rematerialize
True if rematerializing on every Init() call (e.g., because we have a dependency on a value from outs...
Definition: materialize_path_parameters.h:79
Mem_root_array< Operand > m_operands
Definition: materialize_path_parameters.h:57
Common_table_expr * cte
If materializing a CTE, points to it (see m_cte), otherwise nullptr.
Definition: materialize_path_parameters.h:64
bool reject_multiple_rows
True if this is the top level iterator for a materialized derived table transformed from a scalar sub...
Definition: materialize_path_parameters.h:98
ha_rows limit_rows
Used for when pushing LIMIT down to MaterializeIterator; this is more efficient than having a LimitOf...
Definition: materialize_path_parameters.h:91
TABLE * table
Handle to table to materialize into.
Definition: materialize_path_parameters.h:61
int ref_slice
Definition: materialize_path_parameters.h:73
Query_expression * unit
The query expression we are materializing.
Definition: materialize_path_parameters.h:67
Mem_root_array< const AccessPath * > * invalidators
Definition: materialize_path_parameters.h:58
A position of table within a join order.
Definition: sql_select.h:352
A filter of some sort that is not a join condition (those are stored in JoinPredicate objects).
Definition: access_path.h:117
hypergraph::NodeMap total_eligibility_set
Definition: access_path.h:130
bool was_join_condition
Definition: access_path.h:143
Mem_root_array< int > functional_dependencies_idx
Definition: access_path.h:155
FunctionalDependencySet functional_dependencies
Definition: access_path.h:154
int source_multiple_equality_idx
Definition: access_path.h:151
hypergraph::NodeMap used_nodes
Definition: access_path.h:121
Item * condition
Definition: access_path.h:118
double selectivity
Definition: access_path.h:132
Mem_root_array< ContainedSubquery > contained_subqueries
Definition: access_path.h:160
Represents an expression tree in the relational algebra of joins.
Definition: relational_expression.h:144