1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
|
/* -*- mode: c++; c-basic-offset: 2; indent-tabs-mode: nil; -*-
* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
*
* Copyright (C) 2008-2009 Sun Microsystems
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; version 2 of the License.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef DRIZZLED_OPTIMIZER_QUICK_ROR_INTERSECT_SELECT_H
#define DRIZZLED_OPTIMIZER_QUICK_ROR_INTERSECT_SELECT_H
#include "drizzled/optimizer/range.h"
#include <boost/dynamic_bitset.hpp>
#include <vector>
namespace drizzled
{
namespace optimizer
{
/**
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.
*/
class QuickRorIntersectSelect : public QuickSelectInterface
{
public:
QuickRorIntersectSelect(Session *session,
Table *table,
bool retrieve_full_rows,
memory::Root *parent_alloc);
~QuickRorIntersectSelect();
/**
* Do post-constructor initialization.
* SYNOPSIS
* QuickRorIntersectSelect::init()
*
* RETURN
* @retval 0 OK
* @retval other Error code
*/
int init();
/**
* Initialize quick select for row retrieval.
* SYNOPSIS
* reset()
* RETURN
* @retval 0 OK
* @retval other Error code
*/
int reset(void);
/**
* 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
* @retval 0 - Ok
* @retval other - Error code if any error occurred.
*/
int get_next();
bool reverse_sorted() const
{
return false;
}
bool unique_key_range() const
{
return false;
}
int get_type() const
{
return QS_TYPE_ROR_INTERSECT;
}
void add_keys_and_lengths(String *key_names, String *used_lengths);
void add_info_string(String *str);
bool is_keys_used(const boost::dynamic_bitset<>& fields);
/**
* 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
* @retval 0 OK
* @retval other error code
*/
int init_ror_merged_scan(bool reuse_handler);
/**
* 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
* @retval false OK
* @retval true Out of memory.
*/
bool push_quick_back(QuickRangeSelect *quick_sel_range);
/**
* Range quick selects this intersection consists of, not including
* cpk_quick.
*/
std::vector<QuickRangeSelect *> quick_selects;
/**
* 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.
*/
QuickRangeSelect *cpk_quick;
memory::Root alloc; /**< Memory pool for this and merged quick selects data. */
Session *session; /**< Pointer to the current session */
bool need_to_fetch_row; /**< if true, do retrieve full table records. */
/** in top-level quick select, true if merged scans where initialized */
bool scans_inited;
};
} /* namespace optimizer */
} /* namespace drizzled */
#endif /* DRIZZLED_OPTIMIZER_QUICK_ROR_INTERSECT_SELECT_H */
|