23#ifndef SQL_RANGE_OPTIMIZER_INDEX_SKIP_SCAN_PLAN_H_
24#define SQL_RANGE_OPTIMIZER_INDEX_SKIP_SCAN_PLAN_H_
105 bool skip_records_in_range,
106 bool force_skip_scan);
109 bool skip_records_in_range,
110 bool force_skip_scan);
A wrapper class which provides array bounds checking.
Definition: sql_array.h:46
A typesafe replacement for DYNAMIC_ARRAY.
Definition: mem_root_array.h:425
A JSON object (unordered set of key/value pairs).
Definition: opt_trace.h:798
Definition: range_opt_param.h:28
A graph of (possible multiple) key ranges, represented as a red-black binary tree.
Definition: tree.h:67
For each client connection we create a separate thread with THD serving as a thread/connection descri...
Definition: sql_lexer_thd.h:33
void trace_basic_info_index_skip_scan(THD *thd, const AccessPath *path, const RANGE_OPT_PARAM *param, Opt_trace_object *trace_object)
Definition: index_skip_scan_plan.cc:69
void dbug_dump_index_skip_scan(int indent, bool verbose, const AccessPath *path)
Definition: index_skip_scan_plan.cc:799
Mem_root_array< AccessPath * > get_all_skip_scans(THD *thd, RANGE_OPT_PARAM *param, SEL_TREE *tree, enum_order order_direction, bool skip_records_in_range, bool force_skip_scan)
Test if skip scan is applicable and if so, construct a new AccessPath for each candidate index skip s...
Definition: index_skip_scan_plan.cc:140
AccessPath * get_best_skip_scan(THD *thd, RANGE_OPT_PARAM *param, SEL_TREE *tree, enum_order order_direction, bool skip_records_in_range, bool force_skip_scan)
Test if skip scan is applicable and if so, construct a new AccessPath.
Definition: index_skip_scan_plan.cc:209
enum_order
Definition: key_spec.h:64
This file includes constants used by all storage engines.
unsigned char uchar
Definition: my_inttypes.h:51
static uint verbose
Definition: mysqlcheck.cc:65
static char * path
Definition: mysqldump.cc:140
Access paths are a query planning structure that correspond 1:1 to iterators, in that an access path ...
Definition: access_path.h:193
Definition: index_skip_scan_plan.h:52
Bounds_checked_array< uchar * > eq_key_prefixes
Definition: index_skip_scan_plan.h:53
unsigned cur_eq_prefix
Definition: index_skip_scan_plan.h:65
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
double read_cost
Total cost of read.
Definition: index_skip_scan_plan.h:79
uint eq_prefix_len
Length of the equality prefix.
Definition: index_skip_scan_plan.h:74
uchar * min_range_key
Definition: index_skip_scan_plan.h:82
uint range_cond_flag
Definition: index_skip_scan_plan.h:86
KEY * index_info
The index chosen for data access.
Definition: index_skip_scan_plan.h:73
bool has_aggregate_function
TRUE if there are aggregate functions.
Definition: index_skip_scan_plan.h:98
uint num_output_rows
Definition: index_skip_scan_plan.h:88
uint range_key_len
Definition: index_skip_scan_plan.h:87
uchar * max_search_key
Definition: index_skip_scan_plan.h:85
uchar * max_range_key
Definition: index_skip_scan_plan.h:83
SEL_ROOT * index_range_tree
The sub-tree corresponding to index_info.
Definition: index_skip_scan_plan.h:97
uint used_key_parts
Number of index keys used for skip scan.
Definition: index_skip_scan_plan.h:78
uint eq_prefix_key_parts
Number of key parts in the equality prefix.
Definition: index_skip_scan_plan.h:75
uchar * min_search_key
Definition: index_skip_scan_plan.h:84
KEY_PART_INFO * range_key_part
The key part matching the range condition.
Definition: index_skip_scan_plan.h:77
EQPrefix * eq_prefixes
Array of equality constants (IN list)
Definition: index_skip_scan_plan.h:76
const SEL_ARG * range_part_tracing_only
Definition: index_skip_scan_plan.h:95
uint index
Position of chosen index.
Definition: index_skip_scan_plan.h:80
The MEM_ROOT is a simple arena, where allocations are carved out of larger blocks.
Definition: my_alloc.h:82