24#ifndef SQL_JOIN_OPTIMIZER_ACCESS_PATH_H
25#define SQL_JOIN_OPTIMIZER_ACCESS_PATH_H
532 return u.sample_scan;
536 return u.sample_scan;
548 return u.index_distance_scan;
552 return u.index_distance_scan;
564 return u.ref_or_null;
568 return u.ref_or_null;
580 return u.pushed_join_ref;
584 return u.pushed_join_ref;
588 return u.full_text_search;
592 return u.full_text_search;
596 return u.const_table;
600 return u.const_table;
612 return u.follow_tail;
616 return u.follow_tail;
620 return u.index_range_scan;
624 return u.index_range_scan;
628 return u.index_merge;
632 return u.index_merge;
636 return u.rowid_intersection;
640 return u.rowid_intersection;
644 return u.rowid_union;
648 return u.rowid_union;
652 return u.index_skip_scan;
656 return u.index_skip_scan;
660 return u.group_index_skip_scan;
664 return u.group_index_skip_scan;
668 return u.dynamic_index_range_scan;
672 return u.dynamic_index_range_scan;
676 return u.materialized_table_function;
680 return u.materialized_table_function;
684 return u.unqualified_count;
688 return u.unqualified_count;
692 return u.table_value_constructor;
696 return u.table_value_constructor;
700 return u.fake_single_row;
704 return u.fake_single_row;
716 return u.zero_rows_aggregated;
720 return u.zero_rows_aggregated;
740 return u.nested_loop_join;
744 return u.nested_loop_join;
748 return u.nested_loop_semijoin_with_duplicate_removal;
752 return u.nested_loop_semijoin_with_duplicate_removal;
780 return u.temptable_aggregate;
784 return u.temptable_aggregate;
788 return u.limit_offset;
792 return u.limit_offset;
804 return u.materialize;
808 return u.materialize;
812 return u.materialize_information_schema_table;
816 return u.materialize_information_schema_table;
844 return u.remove_duplicates;
848 return u.remove_duplicates;
852 return u.remove_duplicates_on_index;
856 return u.remove_duplicates_on_index;
860 return u.alternative;
864 return u.alternative;
868 return u.cache_invalidator;
872 return u.cache_invalidator;
876 return u.delete_rows;
880 return u.delete_rows;
884 return u.update_rows;
888 return u.update_rows;
1300static_assert(std::is_trivially_destructible<AccessPath>::value,
1301 "AccessPath must be trivially destructible, as it is allocated "
1302 "on the MEM_ROOT and not wrapped in unique_ptr_destroy_only"
1303 "(because multiple candidates during planning could point to "
1304 "the same access paths, and refcounting would be expensive)");
1306 "We are creating a lot of access paths in the join "
1307 "optimizer, so be sure not to bloat it without noticing. "
1308 "(96 bytes for the base, 48 bytes for the variant.)");
1324 bool count_examined_rows) {
1327 path->count_examined_rows = count_examined_rows;
1333 double sampling_percentage,
1334 bool count_examined_rows) {
1337 path->count_examined_rows = count_examined_rows;
1339 path->sample_scan().sampling_percentage = sampling_percentage;
1345 bool count_examined_rows) {
1348 path->count_examined_rows = count_examined_rows;
1350 path->index_scan().idx = idx;
1351 path->index_scan().use_order = use_order;
1358 bool count_examined_rows) {
1361 path->count_examined_rows = count_examined_rows;
1364 path->ref().use_order = use_order;
1371 bool count_examined_rows) {
1374 path->count_examined_rows = count_examined_rows;
1376 path->ref_or_null().ref =
ref;
1377 path->ref_or_null().use_order = use_order;
1382 bool count_examined_rows) {
1385 path->count_examined_rows = count_examined_rows;
1394 bool count_examined_rows) {
1397 path->count_examined_rows = count_examined_rows;
1399 path->pushed_join_ref().ref =
ref;
1400 path->pushed_join_ref().use_order = use_order;
1401 path->pushed_join_ref().is_unique = is_unique;
1408 bool use_order,
bool use_limit,
1409 bool count_examined_rows) {
1412 path->count_examined_rows = count_examined_rows;
1414 path->full_text_search().ref =
ref;
1415 path->full_text_search().use_order = use_order;
1416 path->full_text_search().use_limit = use_limit;
1417 path->full_text_search().ft_func = ft_func;
1423 bool count_examined_rows) {
1426 path->count_examined_rows = count_examined_rows;
1427 path->set_num_output_rows(1.0);
1428 path->set_cost(0.0);
1429 path->set_init_cost(0.0);
1430 path->set_init_once_cost(0.0);
1432 path->const_table().ref =
ref;
1442 path->mrr().mrr_flags = mrr_flags;
1445 path->mrr().bka_path =
nullptr;
1451 bool count_examined_rows) {
1454 path->count_examined_rows = count_examined_rows;
1463 path->count_examined_rows = count_examined_rows;
1464 path->dynamic_index_range_scan().table =
table;
1465 path->dynamic_index_range_scan().qep_tab = qep_tab;
1474 path->materialized_table_function().table =
table;
1475 path->materialized_table_function().table_function = table_function;
1476 path->materialized_table_function().table_path = table_path;
1491 KEY *
key,
size_t key_len) {
1494 path->nested_loop_semijoin_with_duplicate_removal().outer = outer;
1495 path->nested_loop_semijoin_with_duplicate_removal().inner = inner;
1496 path->nested_loop_semijoin_with_duplicate_removal().table =
table;
1497 path->nested_loop_semijoin_with_duplicate_removal().key =
key;
1498 path->nested_loop_semijoin_with_duplicate_removal().key_len = key_len;
1506 path->filter().child = child;
1507 path->filter().condition = condition;
1508 path->filter().materialize_subqueries =
false;
1509 path->has_group_skip_scan = child->has_group_skip_scan;
1516 ORDER *order,
bool count_examined_rows);
1522 path->aggregate().child = child;
1523 path->aggregate().olap = olap;
1524 path->has_group_skip_scan = child->has_group_skip_scan;
1533 path->temptable_aggregate().subquery_path = subquery_path;
1534 path->temptable_aggregate().temp_table_param = temp_table_param;
1535 path->temptable_aggregate().table =
table;
1536 path->temptable_aggregate().table_path = table_path;
1537 path->temptable_aggregate().ref_slice = ref_slice;
1543 bool count_all_rows,
1544 bool reject_multiple_rows,
1545 ha_rows *send_records_override) {
1549 path->immediate_update_delete_table = child->immediate_update_delete_table;
1550 path->limit_offset().child = child;
1551 path->limit_offset().limit = limit;
1552 path->limit_offset().offset = offset;
1553 path->limit_offset().count_all_rows = count_all_rows;
1554 path->limit_offset().reject_multiple_rows = reject_multiple_rows;
1555 path->limit_offset().send_records_override = send_records_override;
1556 path->ordering_state = child->ordering_state;
1557 path->has_group_skip_scan = child->has_group_skip_scan;
1563 bool count_examined_rows) {
1566 path->count_examined_rows = count_examined_rows;
1567 path->set_num_output_rows(1.0);
1568 path->set_cost(0.0);
1569 path->set_init_cost(0.0);
1570 path->set_init_once_cost(0.0);
1575 const char *cause) {
1578 path->zero_rows().child = child;
1579 path->zero_rows().cause = cause;
1580 path->set_num_output_rows(0.0);
1581 path->set_cost(0.0);
1582 path->set_init_cost(0.0);
1583 path->set_init_once_cost(0.0);
1584 path->num_output_rows_before_filter = 0.0;
1585 path->set_cost_before_filter(0.0);
1594 const char *cause) {
1597 path->zero_rows_aggregated().cause = cause;
1598 path->set_num_output_rows(1.0);
1599 path->set_cost(0.0);
1600 path->set_init_cost(0.0);
1610 path->stream().child = child;
1612 path->stream().temp_table_param = temp_table_param;
1614 path->stream().ref_slice = ref_slice;
1616 path->stream().provide_rowid =
false;
1617 path->has_group_skip_scan = child->has_group_skip_scan;
1625 assert(
path !=
nullptr);
1641 int ref_slice,
bool rematerialize,
ha_rows limit_rows,
1642 bool reject_multiple_rows) {
1646 if (rematerialize) {
1674 path->materialize().table_path = table_path;
1675 path->materialize().param = param;
1677 if (rematerialize) {
1690 path->materialize_information_schema_table().table_path = table_path;
1691 path->materialize_information_schema_table().table_list = table_list;
1692 path->materialize_information_schema_table().condition = condition;
1714 path->append().children = children;
1715 double num_output_rows = 0.0;
1718 path->set_init_cost(
AddCost(
path->init_cost(), child.path->init_cost()));
1719 path->set_init_once_cost(
path->init_once_cost() +
1720 child.path->init_once_cost());
1721 num_output_rows += child.path->num_output_rows();
1723 path->set_num_output_rows(num_output_rows);
1730 int ref_slice,
bool needs_buffering) {
1733 path->window().child = child;
1734 path->window().window = window;
1735 path->window().temp_table =
nullptr;
1736 path->window().temp_table_param = temp_table_param;
1737 path->window().ref_slice = ref_slice;
1738 path->window().needs_buffering = needs_buffering;
1739 path->set_num_output_rows(child->num_output_rows());
1747 path->weedout().child = child;
1748 path->weedout().weedout_table = weedout_table;
1749 path->weedout().tables_to_get_rowid_for =
1756 int group_items_size) {
1759 path->remove_duplicates().child = child;
1760 path->remove_duplicates().group_items = group_items;
1761 path->remove_duplicates().group_items_size = group_items_size;
1762 path->has_group_skip_scan = child->has_group_skip_scan;
1768 unsigned loosescan_key_len) {
1771 path->remove_duplicates_on_index().child = child;
1772 path->remove_duplicates_on_index().table =
table;
1773 path->remove_duplicates_on_index().key =
key;
1774 path->remove_duplicates_on_index().loosescan_key_len = loosescan_key_len;
1775 path->has_group_skip_scan = child->has_group_skip_scan;
1784 path->alternative().table_scan_path = table_scan_path;
1785 path->alternative().child = child;
1786 path->alternative().used_ref = used_ref;
1794 path->cache_invalidator().child = child;
1795 path->cache_invalidator().name =
name;
1815 bool eligible_for_batch_mode);
1823 eligible_for_batch_mode);
1827 const POSITION *pos,
bool is_after_filter,
1874 unsigned num_where_predicates);
1882 int num_where_predicates);
1888 unsigned num_where_predicates);
1910 const std::vector<HashJoinCondition> &equijoin_conditions,
constexpr double kUnknownCost
To indicate that a cost estimate is not yet made.
Definition: access_path.h:189
AccessPath * NewStreamingAccessPath(THD *thd, AccessPath *child, JOIN *join, Temp_table_param *temp_table_param, TABLE *table, int ref_slice)
Definition: access_path.h:1604
AccessPath * NewRemoveDuplicatesAccessPath(THD *thd, AccessPath *child, Item **group_items, int group_items_size)
Definition: access_path.h:1754
AccessPath * NewInvalidatorAccessPath(THD *thd, AccessPath *child, const char *name)
Definition: access_path.h:1790
AccessPath * NewRefAccessPath(THD *thd, TABLE *table, Index_lookup *ref, bool use_order, bool reverse, bool count_examined_rows)
Definition: access_path.h:1356
AccessPath * NewDeleteRowsAccessPath(THD *thd, AccessPath *child, table_map delete_tables, table_map immediate_tables)
Definition: access_path.cc:122
void CopyBasicProperties(const AccessPath &from, AccessPath *to)
Definition: access_path.h:1310
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:1496
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:1405
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:1528
table_map GetHashJoinTables(AccessPath *path)
Returns the tables that are part of a hash join.
Definition: access_path.cc:1621
AccessPath * NewDynamicIndexRangeScanAccessPath(THD *thd, TABLE *table, QEP_TAB *qep_tab, bool count_examined_rows)
Definition: access_path.h:1459
AccessPath * NewZeroRowsAggregatedAccessPath(THD *thd, const char *cause)
Definition: access_path.h:1593
AccessPath * NewAlternativeAccessPath(THD *thd, AccessPath *child, AccessPath *table_scan_path, Index_lookup *used_ref)
Definition: access_path.h:1779
AccessPath * NewUpdateRowsAccessPath(THD *thd, AccessPath *child, table_map delete_tables, table_map immediate_tables)
Definition: access_path.cc:134
AccessPath * NewMRRAccessPath(THD *thd, TABLE *table, Index_lookup *ref, int mrr_flags)
Definition: access_path.h:1436
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:272
AccessPath * NewAppendAccessPath(THD *thd, Mem_root_array< AppendPathParameters > *children)
Definition: access_path.h:1710
AccessPath * NewNestedLoopSemiJoinWithDuplicateRemovalAccessPath(THD *thd, AccessPath *outer, AccessPath *inner, const TABLE *table, KEY *key, size_t key_len)
Definition: access_path.h:1489
AccessPath * NewRemoveDuplicatesOnIndexAccessPath(THD *thd, AccessPath *child, TABLE *table, KEY *key, unsigned loosescan_key_len)
Definition: access_path.h:1766
AccessPath * NewFakeSingleRowAccessPath(THD *thd, bool count_examined_rows)
Definition: access_path.h:1562
AccessPath * NewTableValueConstructorAccessPath(const THD *thd, const JOIN *join)
Definition: access_path.cc:166
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:1485
AccessPath * NewFilterAccessPath(THD *thd, AccessPath *child, Item *condition)
Definition: access_path.h:1502
constexpr double kUnknownRowCount
To indicate that a row estimate is not yet made.
Definition: access_path.h:184
AccessPath * NewSortAccessPath(THD *thd, AccessPath *child, Filesort *filesort, ORDER *order, bool count_examined_rows)
Definition: access_path.cc:87
AccessPath * NewMaterializedTableFunctionAccessPath(THD *thd, TABLE *table, Table_function *table_function, AccessPath *table_path)
Definition: access_path.h:1469
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:1637
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:303
AccessPath * NewTableScanAccessPath(THD *thd, TABLE *table, bool count_examined_rows)
Definition: access_path.h:1323
AccessPath * NewSampleScanAccessPath(THD *thd, TABLE *table, double sampling_percentage, bool count_examined_rows)
Definition: access_path.h:1332
AccessPath * NewAggregateAccessPath(THD *thd, AccessPath *child, olap_type olap)
Definition: access_path.h:1518
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:1609
double AddCost(double c1, double c2)
Add path costs c1 and c2, but handle kUnknownCost correctly.
Definition: access_path.h:1697
AccessPath * NewMaterializeInformationSchemaTableAccessPath(THD *thd, AccessPath *table_path, Table_ref *table_list, Item *condition)
Definition: access_path.h:1686
void FindTablesToGetRowidFor(AccessPath *path)
Modifies "path" and the paths below it so that they provide row IDs for all tables.
Definition: access_path.cc:1341
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:215
AccessPath * NewRefOrNullAccessPath(THD *thd, TABLE *table, Index_lookup *ref, bool use_order, bool count_examined_rows)
Definition: access_path.h:1369
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:1541
AccessPath * NewEQRefAccessPath(THD *thd, TABLE *table, Index_lookup *ref, bool count_examined_rows)
Definition: access_path.h:1381
AccessPath * NewWindowAccessPath(THD *thd, AccessPath *child, Window *window, Temp_table_param *temp_table_param, int ref_slice, bool needs_buffering)
Definition: access_path.h:1727
AccessPath * NewFollowTailAccessPath(THD *thd, TABLE *table, bool count_examined_rows)
Definition: access_path.h:1450
AccessPath * NewConstTableAccessPath(THD *thd, TABLE *table, Index_lookup *ref, bool count_examined_rows)
Definition: access_path.h:1421
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:488
AccessPath * NewWeedoutAccessPath(THD *thd, AccessPath *child, SJ_TMP_TABLE *weedout_table)
Definition: access_path.h:1743
AccessPath * NewPushedJoinRefAccessPath(THD *thd, TABLE *table, Index_lookup *ref, bool use_order, bool is_unique, bool count_examined_rows)
Definition: access_path.h:1391
AccessPath * NewZeroRowsAccessPath(THD *thd, AccessPath *child, const char *cause)
Definition: access_path.h:1574
AccessPath * NewUnqualifiedCountAccessPath(THD *thd)
Definition: access_path.h:1480
AccessPath * NewIndexScanAccessPath(THD *thd, TABLE *table, int idx, bool use_order, bool reverse, bool count_examined_rows)
Definition: access_path.h:1343
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:1622
After parsing, a Common Table Expression is accessed through a Table_ref.
Definition: table.h:4428
API for getting cost estimates for server operations that are not directly related to a table object.
Definition: opt_costmodel.h:54
Sorting related info.
Definition: filesort.h:52
A class that represents a join condition in a hash join.
Definition: item_cmpfunc.h:87
Definition: item_func.h:3465
Base class that is used to represent any kind of expression in a relational query.
Definition: item.h:936
Definition: sql_optimizer.h:133
A typesafe replacement for DYNAMIC_ARRAY.
Definition: mem_root_array.h:426
Definition: overflow_bitset.h:78
Definition: sql_executor.h:254
Definition: range_optimizer.h:69
This class represents a query expression (one query block or several query blocks combined with UNION...
Definition: sql_lex.h:626
A context for reading through a single table using a chosen access method: index read,...
Definition: row_iterator.h:82
Definition: sql_executor.h:95
For each client connection we create a separate thread with THD serving as a thread/connection descri...
Definition: sql_lexer_thd.h:36
MEM_ROOT * mem_root
Definition: sql_lexer_thd.h:40
Class representing a table function.
Definition: table_function.h:53
Object containing parameters used when creating and using temporary tables.
Definition: temp_table_param.h:95
Represents the (explicit) window of a SQL 2003 section 7.11 <window clause>, or the implicit (inlined...
Definition: window.h:110
static MEM_ROOT mem_root
Definition: client_plugin.cc:114
void EstimateLimitOffsetCost(AccessPath *path)
Estimate the costs and row count for a WINDOW AccessPath.
Definition: cost_model.cc:941
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:367
void SetCostOnTableAccessPath(const Cost_model_server &cost_model, const POSITION *pos, bool is_after_filter, AccessPath *path)
Definition: sql_executor.cc:1923
std::bitset< kMaxSupportedFDs > FunctionalDependencySet
Definition: interesting_orders_defs.h:63
JoinType
Definition: join_type.h:28
static mi_bit_type mask[]
Definition: mi_packrec.cc:141
This file follows Google coding style, except for the name MEM_ROOT (which is kept for historical rea...
std::unique_ptr< T, Destroy_only< T > > unique_ptr_destroy_only
std::unique_ptr, but only destroying.
Definition: my_alloc.h:477
This file includes constants used by all storage engines.
my_off_t ha_rows
Definition: my_base.h:1141
#define HA_POS_ERROR
Definition: my_base.h:1143
uint64_t table_map
Definition: my_table_map.h:30
static char * path
Definition: mysqldump.cc:149
static PFS_engine_table_share_proxy table
Definition: pfs.cc:61
PT & ref(PT *tp)
Definition: tablespace_impl.cc:359
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:40
RangeReverse< Range > reverse(Range &x)
Iterate over a range in reverse.
Definition: utilities.h:132
std::string join(const detail::range auto &rng, std::string_view delim)
join elements of a range into a string separated by a delimiter.
Definition: string.h:74
int delete_tables(PFS_engine_table_share_proxy **, unsigned int) noexcept
Definition: pfs_plugin_table_v1_all_empty.cc:39
olap_type
Definition: olap.h:31
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:60
case opt name
Definition: sslopt-case.h:29
Access paths are a query planning structure that correspond 1:1 to iterators, in that an access path ...
Definition: access_path.h:213
auto & weedout()
Definition: access_path.h:834
struct AccessPath::@62::@79 index_skip_scan
struct AccessPath::@62::@86 zero_rows
auto & filter()
Definition: access_path.h:754
bool count_all_rows
Definition: access_path.h:1219
AccessPath * bka_path
Definition: access_path.h:989
struct AccessPath::@62::@63 table_scan
auto & ref_or_null()
Definition: access_path.h:562
auto & materialized_table_function()
Definition: access_path.h:674
AccessPath * cpk_child
Definition: access_path.h:1050
auto & rowid_union()
Definition: access_path.h:642
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:510
const auto & bka_join() const
Definition: access_path.h:734
TABLE * temp_table
Definition: access_path.h:1256
OverflowBitset equijoin_predicates
Definition: access_path.h:1160
Item ** group_items
Definition: access_path.h:1268
struct AccessPath::@62::@102 weedout
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:421
auto & materialize()
Definition: access_path.h:802
const auto & temptable_aggregate() const
Definition: access_path.h:782
OverflowBitset & subsumed_sargable_join_predicates()
Similar to applied_sargable_join_predicates, bitmap of sargable join predicates that have been applie...
Definition: access_path.h:482
auto & index_scan()
Definition: access_path.h:538
const auto & delete_rows() const
Definition: access_path.h:878
const auto & filter() const
Definition: access_path.h:758
const auto & index_distance_scan() const
Definition: access_path.h:550
auto & delete_rows()
Definition: access_path.h:874
bool reuse_handler
Definition: access_path.h:1027
struct AccessPath::@62::@89 bka_join
KEY_PART * used_key_part
Definition: access_path.h:1001
double m_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:909
olap_type olap
Definition: access_path.h:1206
struct AccessPath::@62::@71 full_text_search
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:462
Item * condition
Definition: access_path.h:1178
struct AccessPath::@62::@74 follow_tail
struct AccessPath::@62::@90 nested_loop_join
const auto & index_merge() const
Definition: access_path.h:630
const auto & update_rows() const
Definition: access_path.h:886
enum AccessPath::Type type
auto & alternative()
Definition: access_path.h:858
auto & pushed_join_ref()
Definition: access_path.h:578
void set_cost(double val)
Definition: access_path.h:395
AccessPath * outer
Definition: access_path.h:1134
auto & index_skip_scan()
Definition: access_path.h:650
struct AccessPath::@62::@69 eq_ref
bool rewrite_semi_to_inner
Definition: access_path.h:1138
const auto & zero_rows_aggregated() const
Definition: access_path.h:718
auto & group_index_skip_scan()
Definition: access_path.h:658
struct AccessPath::@62::@106 cache_invalidator
const auto & eq_ref() const
Definition: access_path.h:574
int group_items_size
Definition: access_path.h:1269
bool use_order
Definition: access_path.h:945
bool pfs_batch_mode
Definition: access_path.h:1152
auto & temptable_aggregate()
Definition: access_path.h:778
AccessPath()
Definition: access_path.h:219
GroupIndexSkipScanParameters * param
Definition: access_path.h:1094
auto & rowid_intersection()
Definition: access_path.h:634
struct AccessPath::@62::@80 group_index_skip_scan
double init_cost() const
Definition: access_path.h:389
struct AccessPath::@62::@105 alternative
bool materialize_subqueries
Definition: access_path.h:1188
AccessPath * child
Definition: access_path.h:1122
bool allow_spill_to_disk
Definition: access_path.h:1136
struct AccessPath::@62::@68 ref_or_null
Index_lookup * used_ref
Definition: access_path.h:1282
struct AccessPath::@62::@97 stream
auto & mrr()
Definition: access_path.h:602
auto & sample_scan()
Definition: access_path.h:530
const auto & index_scan() const
Definition: access_path.h:542
const auto & fake_single_row() const
Definition: access_path.h:702
struct AccessPath::@62::@96 limit_offset
bool reject_multiple_rows
Definition: access_path.h:1220
bool allow_clustered_primary_key_scan
Definition: access_path.h:1042
const char * name
Definition: access_path.h:1286
bool use_limit
Definition: access_path.h:979
Window * window
Definition: access_path.h:1255
table_map tables_to_get_rowid_for
Definition: access_path.h:1139
auto & materialize_information_schema_table()
Definition: access_path.h:810
struct AccessPath::@62::@100 append
auto & bka_join()
Definition: access_path.h:730
struct AccessPath::@62::@94 aggregate
const auto & follow_tail() const
Definition: access_path.h:614
struct AccessPath::@62::@99 materialize_information_schema_table
SJ_TMP_TABLE * weedout_table
Definition: access_path.h:1263
bool has_group_skip_scan
Whether this access path contains a GROUP_INDEX_SKIP_SCAN.
Definition: access_path.h:324
Index_lookup * ref
Definition: access_path.h:956
struct AccessPath::@62::@88 hash_join
const auto & window() const
Definition: access_path.h:830
void set_init_once_cost(double val)
Definition: access_path.h:405
const auto & materialized_table_function() const
Definition: access_path.h:678
struct AccessPath::@62::@107 delete_rows
auto & unqualified_count()
Definition: access_path.h:682
struct AccessPath::@62::@78 rowid_union
bool keep_current_rowid
Definition: access_path.h:991
bool using_extended_key_parts
Definition: access_path.h:1037
auto & nested_loop_join()
Definition: access_path.h:738
const auto & full_text_search() const
Definition: access_path.h:590
struct AccessPath::@62::@85 fake_single_row
struct AccessPath::@62::@84 table_value_constructor
bool can_be_used_for_ror
Definition: access_path.h:1017
float rec_per_key
Definition: access_path.h:1145
Safety safe_for_rowid
Whether it is safe to get row IDs (for sorting) from this access path.
Definition: access_path.h:315
JOIN * join
Definition: access_path.h:1227
struct AccessPath::@62::@73 mrr
unsigned index
Definition: access_path.h:1013
unsigned mrr_buf_size
Definition: access_path.h:1009
struct AccessPath::@62::@95 temptable_aggregate
auto & remove_duplicates()
Definition: access_path.h:842
RowIterator * iterator
If an iterator has been instantiated for this access path, points to the iterator.
Definition: access_path.h:385
struct AccessPath::@62::@64 sample_scan
const auto & stream() const
Definition: access_path.h:798
const auto & remove_duplicates() const
Definition: access_path.h:846
auto & window()
Definition: access_path.h:826
bool need_rows_in_rowid_order
Definition: access_path.h:1021
Table_ref * table_list
Definition: access_path.h:1247
const auto & unqualified_count() const
Definition: access_path.h:686
void * secondary_engine_data
Auxiliary data used by a secondary storage engine while processing the access path during optimizatio...
Definition: access_path.h:519
struct AccessPath::@62::@92 filter
void set_init_cost(double val)
Definition: access_path.h:400
void set_num_output_rows(double val)
Definition: access_path.h:893
bool is_covering
Definition: access_path.h:1070
const auto & mrr() const
Definition: access_path.h:606
void set_cost_before_filter(double val)
Definition: access_path.h:410
bool remove_duplicates
Definition: access_path.h:1200
table_map tables_to_update
Definition: access_path.h:1295
const auto & table_value_constructor() const
Definition: access_path.h:694
KEY * key
Definition: access_path.h:1172
auto & table_value_constructor()
Definition: access_path.h:690
auto & stream()
Definition: access_path.h:794
size_t key_len
Definition: access_path.h:1173
const OverflowBitset & subsumed_sargable_join_predicates() const
Definition: access_path.h:485
const auto & zero_rows() const
Definition: access_path.h:710
const auto & append() const
Definition: access_path.h:822
ha_rows offset
Definition: access_path.h:1218
int idx
Definition: access_path.h:944
auto & hash_join()
Definition: access_path.h:722
auto & cache_invalidator()
Definition: access_path.h:866
bool force_sort_rowids
Definition: access_path.h:1202
unsigned num_used_key_parts
Definition: access_path.h:1014
unsigned num_ranges
Definition: access_path.h:1006
ORDER * order
Definition: access_path.h:1198
auto & sort()
Definition: access_path.h:762
auto & fake_single_row()
Definition: access_path.h:698
struct AccessPath::@62::@77 rowid_intersection
struct AccessPath::@62::@75 index_range_scan
ha_rows limit
Definition: access_path.h:1199
auto & follow_tail()
Definition: access_path.h:610
double m_num_output_rows
Expected number of output rows.
Definition: access_path.h:897
const auto & sample_scan() const
Definition: access_path.h:534
const JoinPredicate * join_predicate
Definition: access_path.h:1135
const auto & const_table() const
Definition: access_path.h:598
const auto & dynamic_index_range_scan() const
Definition: access_path.h:670
const auto & table_scan() const
Definition: access_path.h:526
unsigned mrr_flags
Definition: access_path.h:1008
int ref_slice
Definition: access_path.h:1213
OverflowBitset filter_predicates
Bitmap of WHERE predicates that we are including on this access path, referring to the “predicates” a...
Definition: access_path.h:446
bool can_be_used_for_imerge
Definition: access_path.h:1024
bool forced_by_hint
Definition: access_path.h:1041
auto & limit_offset()
Definition: access_path.h:786
AccessPath * inner
Definition: access_path.h:1134
struct AccessPath::@62::@87 zero_rows_aggregated
QUICK_RANGE * range
Definition: access_path.h:951
bool provide_rowid
Definition: access_path.h:1230
const auto & index_range_scan() const
Definition: access_path.h:622
const auto & ref() const
Definition: access_path.h:558
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:329
Item_func_match * ft_func
Definition: access_path.h:980
ha_rows * send_records_override
Definition: access_path.h:1223
struct AccessPath::@62::@81 dynamic_index_range_scan
auto & table_scan()
Definition: access_path.h:522
struct AccessPath::@62::@83 unqualified_count
const auto & hash_join() const
Definition: access_path.h:726
QEP_TAB * qep_tab
Definition: access_path.h:1098
Table_function * table_function
Definition: access_path.h:1102
auto & zero_rows_aggregated()
Definition: access_path.h:714
const auto & sort() const
Definition: access_path.h:766
bool unwrap_rollup
Definition: access_path.h:1201
Type
Definition: access_path.h:229
@ FOLLOW_TAIL
Definition: access_path.h:244
@ FILTER
Definition: access_path.h:268
@ PUSHED_JOIN_REF
Definition: access_path.h:240
@ ZERO_ROWS_AGGREGATED
Definition: access_path.h:257
@ UPDATE_ROWS
Definition: access_path.h:286
@ AGGREGATE
Definition: access_path.h:270
@ BKA_JOIN
Definition: access_path.h:264
@ ZERO_ROWS
Definition: access_path.h:256
@ CONST_TABLE
Definition: access_path.h:242
@ GROUP_INDEX_SKIP_SCAN
Definition: access_path.h:250
@ SAMPLE_SCAN
Definition: access_path.h:234
@ INDEX_RANGE_SCAN
Definition: access_path.h:245
@ UNQUALIFIED_COUNT
Definition: access_path.h:259
@ EQ_REF
Definition: access_path.h:239
@ FAKE_SINGLE_ROW
Definition: access_path.h:255
@ MATERIALIZE_INFORMATION_SCHEMA_TABLE
Definition: access_path.h:275
@ WINDOW
Definition: access_path.h:277
@ REF_OR_NULL
Definition: access_path.h:238
@ MATERIALIZE
Definition: access_path.h:274
@ NESTED_LOOP_SEMIJOIN_WITH_DUPLICATE_REMOVAL
Definition: access_path.h:263
@ ROWID_UNION
Definition: access_path.h:248
@ INDEX_SKIP_SCAN
Definition: access_path.h:249
@ MRR
Definition: access_path.h:243
@ CACHE_INVALIDATOR
Definition: access_path.h:282
@ INDEX_SCAN
Definition: access_path.h:235
@ TABLE_VALUE_CONSTRUCTOR
Definition: access_path.h:254
@ WEEDOUT
Definition: access_path.h:278
@ MATERIALIZED_TABLE_FUNCTION
Definition: access_path.h:258
@ REMOVE_DUPLICATES_ON_INDEX
Definition: access_path.h:280
@ TABLE_SCAN
Definition: access_path.h:233
@ REF
Definition: access_path.h:237
@ TEMPTABLE_AGGREGATE
Definition: access_path.h:271
@ LIMIT_OFFSET
Definition: access_path.h:272
@ APPEND
Definition: access_path.h:276
@ NESTED_LOOP_JOIN
Definition: access_path.h:262
@ INDEX_MERGE
Definition: access_path.h:246
@ FULL_TEXT_SEARCH
Definition: access_path.h:241
@ ALTERNATIVE
Definition: access_path.h:281
@ STREAM
Definition: access_path.h:273
@ REMOVE_DUPLICATES
Definition: access_path.h:279
@ ROWID_INTERSECTION
Definition: access_path.h:247
@ DYNAMIC_INDEX_RANGE_SCAN
Definition: access_path.h:251
@ DELETE_ROWS
Definition: access_path.h:285
@ SORT
Definition: access_path.h:269
@ INDEX_DISTANCE_SCAN
Definition: access_path.h:236
@ HASH_JOIN
Definition: access_path.h:265
bool retrieve_full_rows
Definition: access_path.h:1053
double m_init_once_cost
Of init_cost, how much of the initialization needs only to be done once per query block.
Definition: access_path.h:921
struct AccessPath::@62::@91 nested_loop_semijoin_with_duplicate_removal
const auto & rowid_union() const
Definition: access_path.h:646
const TABLE * table
Definition: access_path.h:1171
const auto & index_skip_scan() const
Definition: access_path.h:654
auto & dynamic_index_range_scan()
Definition: access_path.h:666
const auto & pushed_join_ref() const
Definition: access_path.h:582
auto & remove_duplicates_on_index()
Definition: access_path.h:850
table_map immediate_tables
Definition: access_path.h:1291
double m_cost_before_filter
If no filter, identical to cost.
Definition: access_path.h:925
double cost() const
Definition: access_path.h:387
int mrr_flags
Definition: access_path.h:990
auto & full_text_search()
Definition: access_path.h:586
const auto & materialize() const
Definition: access_path.h:806
int ordering_state
Which ordering the rows produced by this path follow, if any (see interesting_orders....
Definition: access_path.h:379
auto & eq_ref()
Definition: access_path.h:570
JoinType join_type
Definition: access_path.h:1143
struct AccessPath::@62::@98 materialize
const auto & limit_offset() const
Definition: access_path.h:790
MaterializePathParameters * param
Definition: access_path.h:1241
const char * cause
Definition: access_path.h:1125
auto & update_rows()
Definition: access_path.h:882
auto & index_merge()
Definition: access_path.h:626
auto & aggregate()
Definition: access_path.h:770
double m_cost
Expected cost to read all of this access path once.
Definition: access_path.h:900
const auto & group_index_skip_scan() const
Definition: access_path.h:662
auto & zero_rows()
Definition: access_path.h:706
AccessPath * subquery_path
Definition: access_path.h:1209
Mem_root_array< AppendPathParameters > * children
Definition: access_path.h:1251
struct AccessPath::@62::@76 index_merge
const auto & nested_loop_join() const
Definition: access_path.h:742
bool already_expanded_predicates
Definition: access_path.h:1153
const auto & remove_duplicates_on_index() const
Definition: access_path.h:854
Temp_table_param * temp_table_param
Definition: access_path.h:1210
auto & nested_loop_semijoin_with_duplicate_removal()
Definition: access_path.h:746
bool reverse
Definition: access_path.h:946
AccessPath * table_scan_path
Definition: access_path.h:1278
enum tablesample_type sampling_type
Definition: access_path.h:940
struct AccessPath::@62::@70 pushed_join_ref
const auto & materialize_information_schema_table() const
Definition: access_path.h:814
double subquery_cost
The total cost of executing the queries that we materialize.
Definition: access_path.h:1243
bool geometry
Definition: access_path.h:1030
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:321
unsigned loosescan_key_len
Definition: access_path.h:1275
auto & index_distance_scan()
Definition: access_path.h:546
auto & ref()
Definition: access_path.h:554
struct AccessPath::@62::@108 update_rows
struct AccessPath::@62::@104 remove_duplicates_on_index
table_map tables_to_delete_from
Definition: access_path.h:1290
double init_once_cost() const
Definition: access_path.h:391
struct AccessPath::@62::@93 sort
struct AccessPath::@62::@65 index_scan
IndexSkipScanParameters * param
Definition: access_path.h:1085
const OverflowBitset & applied_sargable_join_predicates() const
Definition: access_path.h:465
Mem_root_array< AccessPath * > * children
Definition: access_path.h:1043
struct AccessPath::@62::@66 index_distance_scan
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:474
AccessPath * table_path
Definition: access_path.h:1103
const auto & aggregate() const
Definition: access_path.h:774
TABLE * table
Definition: access_path.h:935
auto & append()
Definition: access_path.h:818
double cost_before_filter() const
Definition: access_path.h:393
const auto & weedout() const
Definition: access_path.h:838
struct AccessPath::@62::@82 materialized_table_function
const auto & cache_invalidator() const
Definition: access_path.h:870
double sampling_percentage
Definition: access_path.h:939
bool needs_buffering
Definition: access_path.h:1259
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:373
QUICK_RANGE ** ranges
Definition: access_path.h:1005
bool is_unique
Definition: access_path.h:973
const auto & alternative() const
Definition: access_path.h:862
Safety
A general enum to describe the safety of a given operation.
Definition: access_path.h:296
@ 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:305
@ UNSAFE
The given operation is unsafe on this access path, no matter how many or few times it's scanned.
Definition: access_path.h:311
@ SAFE
The given operation is always safe on this access path.
Definition: access_path.h:298
auto & const_table()
Definition: access_path.h:594
unsigned mrr_length_per_rec
Definition: access_path.h:1144
struct AccessPath::@62::@72 const_table
const auto & rowid_intersection() const
Definition: access_path.h:638
Mem_root_array< Item_values_column * > * output_refs
Definition: access_path.h:1109
auto & index_range_scan()
Definition: access_path.h:618
double num_output_rows() const
Definition: access_path.h:891
double num_output_rows_before_filter
If no filter, identical to num_output_rows.
Definition: access_path.h:424
const auto & ref_or_null() const
Definition: access_path.h:566
Filesort * filesort
Definition: access_path.h:1192
bool store_rowids
Definition: access_path.h:1137
const auto & nested_loop_semijoin_with_duplicate_removal() const
Definition: access_path.h:750
Definition: access_path.h:178
JOIN * join
Definition: access_path.h:180
AccessPath * path
Definition: access_path.h:179
Definition: group_index_skip_scan_plan.h:45
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:73
Structure used for index-based lookups.
Definition: sql_opt_exec_shared.h:67
A specification that two specific relational expressions (e.g., two tables, or a table and a join bet...
Definition: access_path.h:78
int semijoin_group_size
Definition: access_path.h:124
FunctionalDependencySet functional_dependencies
Definition: access_path.h:95
Mem_root_array< int > functional_dependencies_idx
Definition: access_path.h:100
RelationalExpression * expr
Definition: access_path.h:79
double selectivity
Definition: access_path.h:80
int ordering_idx_needed_for_semijoin_rewrite
Definition: access_path.h:118
Item ** semijoin_group
Definition: access_path.h:123
size_t estimated_bytes_per_row
Definition: access_path.h:84
Definition: range_optimizer.h:55
The MEM_ROOT is a simple arena, where allocations are carved out of larger blocks.
Definition: my_alloc.h:83
Definition: materialize_path_parameters.h:42
AccessPath * subquery_path
Definition: materialize_path_parameters.h:43
int select_number
Definition: materialize_path_parameters.h:44
JOIN * join
Definition: materialize_path_parameters.h:45
bool copy_items
Definition: materialize_path_parameters.h:47
Temp_table_param * temp_table_param
Definition: materialize_path_parameters.h:48
bool disable_deduplication_by_hash_field
Definition: materialize_path_parameters.h:46
Definition: materialize_path_parameters.h:40
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:80
Mem_root_array< Operand > m_operands
Definition: materialize_path_parameters.h:58
Common_table_expr * cte
If materializing a CTE, points to it (see m_cte), otherwise nullptr.
Definition: materialize_path_parameters.h:65
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:99
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:92
TABLE * table
Handle to table to materialize into.
Definition: materialize_path_parameters.h:62
int ref_slice
Definition: materialize_path_parameters.h:74
Query_expression * unit
The query expression we are materializing.
Definition: materialize_path_parameters.h:68
Mem_root_array< const AccessPath * > * invalidators
Definition: materialize_path_parameters.h:59
A position of table within a join order.
Definition: sql_select.h:355
A filter of some sort that is not a join condition (those are stored in JoinPredicate objects).
Definition: access_path.h:132
hypergraph::NodeMap total_eligibility_set
Definition: access_path.h:145
bool was_join_condition
Definition: access_path.h:158
Mem_root_array< int > functional_dependencies_idx
Definition: access_path.h:170
FunctionalDependencySet functional_dependencies
Definition: access_path.h:169
int source_multiple_equality_idx
Definition: access_path.h:166
hypergraph::NodeMap used_nodes
Definition: access_path.h:136
Item * condition
Definition: access_path.h:133
double selectivity
Definition: access_path.h:147
Mem_root_array< ContainedSubquery > contained_subqueries
Definition: access_path.h:175
Represents an expression tree in the relational algebra of joins.
Definition: relational_expression.h:145
tablesample_type
Definition: tablesample.h:27