#include <btr0sea.h>
Detailed Description
The search info struct in an index
Definition at line 197 of file btr0sea.h.
Member Data Documentation
ulint btr_search_t::hash_analysis |
when this exceeds BTR_SEARCH_HASH_ANALYSIS, the hash analysis starts; this is reset if no success noticed
Definition at line 210 of file btr0sea.h.
ibool btr_search_t::last_hash_succ |
TRUE if the last search would have succeeded, or did succeed, using the hash index; NOTE that the value here is not exact: it is not calculated for every search, and the calculation itself is not always accurate!
Definition at line 214 of file btr0sea.h.
ibool btr_search_t::left_side |
TRUE or FALSE, depending on whether the leftmost record of several records with the same prefix should be indexed in the hash index
Definition at line 231 of file btr0sea.h.
ulint btr_search_t::n_bytes |
ulint btr_search_t::n_fields |
recommended prefix length for hash search: number of full fields
Definition at line 226 of file btr0sea.h.
ulint btr_search_t::n_hash_potential |
number of consecutive searches which would have succeeded, or did succeed, using the hash index; the range is 0 .. BTR_SEARCH_BUILD_LIMIT + 5
Definition at line 220 of file btr0sea.h.
ulint btr_search_t::ref_count |
Number of blocks in this index tree that have search index built i.e. block->index points to this index. Protected by btr_search_latch except when during initialization in btr_search_info_create().
Definition at line 198 of file btr0sea.h.
the root page frame when it was last time fetched, or NULL
Definition at line 208 of file btr0sea.h.
The documentation for this struct was generated from the following file: