#include <quick_ror_intersect_select.h>
Public Types | |
enum | { QS_TYPE_RANGE = 0, QS_TYPE_INDEX_MERGE = 1, QS_TYPE_RANGE_DESC = 2, QS_TYPE_ROR_INTERSECT = 4, QS_TYPE_ROR_UNION = 5, QS_TYPE_GROUP_MIN_MAX = 6 } |
Public Member Functions | |
QuickRorIntersectSelect (Session *session, Table *table, bool retrieve_full_rows, memory::Root *parent_alloc) | |
int | init () |
int | reset (void) |
int | get_next () |
bool | reverse_sorted () const |
bool | unique_key_range () const |
int | get_type () const |
void | add_keys_and_lengths (std::string *key_names, std::string *used_lengths) |
void | add_info_string (std::string *str) |
bool | is_keys_used (const boost::dynamic_bitset<> &fields) |
int | init_ror_merged_scan (bool reuse_handler) |
void | push_quick_back (QuickRangeSelect *quick_sel_range) |
virtual void | range_end () |
virtual void | save_last_pos () |
Public Attributes | |
std::vector< QuickRangeSelect * > | quick_selects |
QuickRangeSelect * | cpk_quick |
memory::Root | alloc |
Session * | session |
bool | need_to_fetch_row |
bool | scans_inited |
bool | sorted |
ha_rows | records |
double | read_time |
Table * | head |
uint32_t | index |
uint32_t | max_used_key_length |
uint32_t | used_key_parts |
unsigned char * | last_rowid |
unsigned char * | record |
Rowid-Ordered Retrieval (ROR) index intersection quick select. This quick select produces intersection of row sequences returned by several QuickRangeSelects it "merges".
All merged QuickRangeSelects must return rowids in rowid order. QuickRorIntersectSelect will return rows in rowid order, too.
All merged quick selects retrieve {rowid, covered_fields} tuples (not full table records). QuickRorIntersectSelect retrieves full records if it is not being used by QuickRorIntersectSelect and all merged quick selects together don't cover needed all fields.
If one of the merged quick selects is a Clustered PK range scan, it is used only to filter rowid sequence produced by other merged quick selects.
Definition at line 50 of file quick_ror_intersect_select.h.
|
virtual |
Append text representation of quick select structure (what and how is merged) to str. The result is added to "Extra" field in EXPLAIN output.
This function is implemented only by quick selects that merge other quick selects output and/or can produce output suitable for merging.
Reimplemented from drizzled::optimizer::QuickSelectInterface.
Definition at line 233 of file quick_ror_intersect_select.cc.
References drizzled::optimizer::QuickSelectInterface::index.
|
virtual |
Append comma-separated list of keys this quick select uses to key_names; append comma-separated list of corresponding used lengths to used_lengths.
Implements drizzled::optimizer::QuickSelectInterface.
Definition at line 256 of file quick_ror_intersect_select.cc.
References drizzled::optimizer::QuickSelectInterface::index, and drizzled::optimizer::QuickSelectInterface::max_used_key_length.
|
virtual |
Retrieve next record. SYNOPSIS QuickRorIntersectSelect::get_next()
NOTES Invariant on enter/exit: all intersected selects have retrieved all index records with rowid <= some_rowid_val and no intersected select has retrieved any index records with rowid > some_rowid_val. We start fresh and loop until we have retrieved the same rowid in each of the key scans or we got an error.
If a Clustered PK scan is present, it is used only to check if row satisfies its condition (and never used for row retrieval).
RETURN
0 | - Ok |
other | - Error code if any error occurred. |
Implements drizzled::optimizer::QuickSelectInterface.
Definition at line 154 of file quick_ror_intersect_select.cc.
References drizzled::optimizer::QuickRangeSelect::get_next(), and drizzled::optimizer::QuickSelectInterface::record.
|
inlinevirtual |
Returns the type of this quick select - one of the QS_TYPE_* values
Implements drizzled::optimizer::QuickSelectInterface.
Definition at line 113 of file quick_ror_intersect_select.h.
|
virtual |
Do post-constructor initialization. SYNOPSIS QuickRorIntersectSelect::init()
RETURN
0 | OK |
other | Error code |
Implements drizzled::optimizer::QuickSelectInterface.
Definition at line 81 of file quick_ror_intersect_select.cc.
|
virtual |
Initialize this quick select to be a part of a ROR-merged scan. SYNOPSIS QuickRorIntersectSelect::init_ror_merged_scan() reuse_handler If true, use head->cursor, otherwise create separate Cursor object. RETURN
0 | OK |
other | error code |
Reimplemented from drizzled::optimizer::QuickSelectInterface.
Definition at line 88 of file quick_ror_intersect_select.cc.
References drizzled::optimizer::QuickRangeSelect::init_ror_merged_scan().
|
virtual |
Returns true if any index used by this quick select uses field which is marked in passed bitmap.
Reimplemented from drizzled::optimizer::QuickSelectInterface.
Definition at line 143 of file quick_ror_intersect_select.cc.
References drizzled::optimizer::QuickSelectInterface::index.
void drizzled::optimizer::QuickRorIntersectSelect::push_quick_back | ( | optimizer::QuickRangeSelect * | quick | ) |
Add a merged quick select to this ROR-intersection quick select.
SYNOPSIS QuickRorIntersectSelect::push_quick_back() quick Quick select to be added. The quick select must return rows in rowid order. NOTES This call can only be made before init() is called.
RETURN
false | OK |
true | Out of memory. |
Definition at line 137 of file quick_ror_intersect_select.cc.
|
inlinevirtualinherited |
Range end should be called when we have looped over the whole index
Reimplemented in drizzled::optimizer::QuickRangeSelect.
|
virtual |
Initialize quick select for row retrieval. SYNOPSIS reset() RETURN
0 | OK |
other | Error code |
Implements drizzled::optimizer::QuickSelectInterface.
Definition at line 126 of file quick_ror_intersect_select.cc.
References drizzled::optimizer::QuickRangeSelect::reset().
|
inlinevirtualinherited |
Save ROWID of last retrieved row in file->ref. This used in ROR-merging.
Reimplemented in drizzled::optimizer::QuickRangeSelect.
Definition at line 221 of file range.h.
Referenced by drizzled::optimizer::QuickRorUnionSelect::get_next(), and drizzled::optimizer::QuickRorUnionSelect::reset().
memory::Root drizzled::optimizer::QuickRorIntersectSelect::alloc |
Memory pool for this and merged quick selects data.
Definition at line 162 of file quick_ror_intersect_select.h.
QuickRangeSelect* drizzled::optimizer::QuickRorIntersectSelect::cpk_quick |
Merged quick select that uses Clustered PK, if there is one. This quick select is not used for row retrieval, it is used for row retrieval.
Definition at line 160 of file quick_ror_intersect_select.h.
|
inherited |
Index this quick select uses, or MAX_KEY for quick selects that use several indexes
Definition at line 106 of file range.h.
Referenced by add_info_string(), add_keys_and_lengths(), drizzled::optimizer::QuickIndexMergeSelect::add_keys_and_lengths(), drizzled::best_access_path(), drizzled::optimizer::Scan::getStats(), is_keys_used(), drizzled::optimizer::QuickIndexMergeSelect::is_keys_used(), drizzled::optimizer::QuickGroupMinMaxSelect::reset(), drizzled::test_if_skip_sort_order(), and drizzled::update_query().
|
inherited |
The rowid of last row retrieved by this quick select. This is used only when doing ROR-index_merge selects
Definition at line 124 of file range.h.
Referenced by drizzled::optimizer::QuickRorUnionSelect::get_next().
|
inherited |
Total length of first used_key_parts parts of the key. Applicable if index!= MAX_KEY.
Definition at line 111 of file range.h.
Referenced by add_keys_and_lengths(), drizzled::optimizer::QuickIndexMergeSelect::add_keys_and_lengths(), drizzled::optimizer::QuickGroupMinMaxSelect::add_keys_and_lengths(), drizzled::optimizer::QuickGroupMinMaxSelect::adjust_prefix_ranges(), and drizzled::optimizer::QuickGroupMinMaxSelect::update_key_stat().
bool drizzled::optimizer::QuickRorIntersectSelect::need_to_fetch_row |
if true, do retrieve full table records.
Definition at line 164 of file quick_ror_intersect_select.h.
std::vector<QuickRangeSelect*> drizzled::optimizer::QuickRorIntersectSelect::quick_selects |
Range quick selects this intersection consists of, not including cpk_quick.
Definition at line 154 of file quick_ror_intersect_select.h.
|
inherited |
time to perform this retrieval
Definition at line 100 of file range.h.
Referenced by drizzled::best_access_path(), and drizzled::make_join_statistics().
|
inherited |
Table record buffer used by this quick select.
Definition at line 129 of file range.h.
Referenced by drizzled::optimizer::QuickRorUnionSelect::get_next(), get_next(), and drizzled::optimizer::QuickIndexMergeSelect::read_keys_and_merge().
|
inherited |
estimate of # of records to be retrieved
Definition at line 99 of file range.h.
Referenced by drizzled::FileSort::run().
bool drizzled::optimizer::QuickRorIntersectSelect::scans_inited |
in top-level quick select, true if merged scans where initialized
Definition at line 166 of file quick_ror_intersect_select.h.
Session* drizzled::optimizer::QuickRorIntersectSelect::session |
Pointer to the current session
Definition at line 163 of file quick_ror_intersect_select.h.
|
inherited |
Maximum number of (first) key parts this quick select uses for retrieval. eg. for "(key1p1=c1 AND key1p2=c2) OR key1p1=c2" used_key_parts == 2. Applicable if index!= MAX_KEY.
For QUICK_GROUP_MIN_MAX_SELECT it includes MIN/MAX argument keyparts.
Definition at line 119 of file range.h.
Referenced by drizzled::test_if_skip_sort_order(), and drizzled::optimizer::QuickGroupMinMaxSelect::update_key_stat().