MySQL 8.3.0
Source Code Documentation
range_analysis.h
Go to the documentation of this file.
1/* Copyright (c) 2000, 2023, Oracle and/or its affiliates.
2
3 This program is free software; you can redistribute it and/or modify
4 it under the terms of the GNU General Public License, version 2.0,
5 as published by the Free Software Foundation.
6
7 This program is also distributed with certain software (including
8 but not limited to OpenSSL) that is licensed under separate terms,
9 as designated in a particular file or component or in included license
10 documentation. The authors of MySQL hereby grant you an additional
11 permission to link the program and your derivative works with the
12 separately licensed software that they have included with MySQL.
13
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License, version 2.0, for more details.
18
19 You should have received a copy of the GNU General Public License
20 along with this program; if not, write to the Free Software
21 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */
22
23#ifndef SQL_RANGE_OPTIMIZER_RANGE_ANALYSIS_H_
24#define SQL_RANGE_OPTIMIZER_RANGE_ANALYSIS_H_
25
26#include "my_table_map.h"
27
28class SEL_TREE;
29class RANGE_OPT_PARAM;
30class Item;
31class THD;
32
33/*
34 RangeAnalysisModule
35 A module that accepts a condition, index (or partitioning) description,
36 and builds lists of intervals (in index/partitioning space), such that
37 all possible records that match the condition are contained within the
38 intervals.
39 The entry point for the range analysis module is get_mm_tree()
40 (mm=min_max) function.
41
42 The lists are returned in form of complicated structure of interlinked
43 SEL_TREE/SEL_IMERGE/SEL_ROOT/SEL_ARG objects.
44 See quick_range_seq_next, find_used_partitions for examples of how to walk
45 this structure.
46 All direct "users" of this module are located within this file, too.
47
48 */
49SEL_TREE *get_mm_tree(THD *thd, RANGE_OPT_PARAM *param, table_map prev_tables,
50 table_map read_tables, table_map current_table,
51 bool remove_jump_scans, Item *cond);
52
53#endif // SQL_RANGE_OPTIMIZER_RANGE_ANALYSIS_H_
Base class that is used to represent any kind of expression in a relational query.
Definition: item.h:933
Definition: range_opt_param.h:28
Definition: tree.h:870
For each client connection we create a separate thread with THD serving as a thread/connection descri...
Definition: sql_lexer_thd.h:35
uint64_t table_map
Definition: my_table_map.h:29
SEL_TREE * get_mm_tree(THD *thd, RANGE_OPT_PARAM *param, table_map prev_tables, table_map read_tables, table_map current_table, bool remove_jump_scans, Item *cond)
The Range Analysis Module, which finds range access alternatives applicable to single or multi-index ...
Definition: range_analysis.cc:844