MySQL 8.4.0
Source Code Documentation
anonymous_namespace{}::PossibleIndexMerge Struct Reference

Represents a candidate index merge, ie. More...

Public Attributes

size_t pred_idx
bool inexact

Detailed Description

Represents a candidate index merge, ie.

an OR expression of several range scans across different indexes (that can be reconciled by doing deduplication by sorting on row IDs).

Each predicate (in our usual sense of “part of a top-level AND conjunction in WHERE”) can give rise to multiple index merges (if there are AND conjunctions within ORs), but one index merge arises from exactly one predicate. This is not an inherent limitation, but it is how tree_and() does it; if it takes two SEL_TREEs with index merges, it just combines their candidates wholesale; each will deal with one predicate, and the other one would just have to be applied as a filter.

This is obviously suboptimal, as there are many cases where we could do better. Imagine something like (a = 3 OR b > 3) AND b <= 5, with separate indexes on a and b; obviously, we could have applied this as a single index merge between two range scans: (a = 3 AND b <= 5) OR (b > 3 AND b <= 5). But this is probably not a priority for us, so we follow the range optimizer's lead here and record each index merge as covering a separate, single predicate.

Member Data Documentation

◆ imerge

SEL_IMERGE* anonymous_namespace{}::PossibleIndexMerge::imerge

◆ inexact

bool anonymous_namespace{}::PossibleIndexMerge::inexact

◆ pred_idx

size_t anonymous_namespace{}::PossibleIndexMerge::pred_idx

The documentation for this struct was generated from the following file: