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
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
// Unit tests for predicate_blueprint.
#include <vespa/searchlib/attribute/predicate_attribute.h>
#include <vespa/searchlib/predicate/predicate_tree_annotator.h>
#include <vespa/searchlib/predicate/predicate_index.h>
#include <vespa/searchlib/fef/termfieldmatchdataarray.h>
#include <vespa/searchlib/query/tree/predicate_query_term.h>
#include <vespa/searchlib/query/tree/simplequery.h>
#include <vespa/searchlib/query/weight.h>
#include <vespa/searchlib/queryeval/field_spec.h>
#include <vespa/searchlib/queryeval/predicate_blueprint.h>
#include <vespa/searchlib/predicate/predicate_hash.h>
#include <vespa/vespalib/testkit/testapp.h>
#include <vespa/log/log.h>
LOG_SETUP("predicate_blueprint_test");
using namespace search;
using namespace search::predicate;
using search::fef::TermFieldMatchDataArray;
using search::query::PredicateQueryTerm;
using search::query::SimplePredicateQuery;
using search::query::Weight;
using search::queryeval::FieldSpecBase;
using search::queryeval::PredicateBlueprint;
using search::queryeval::SearchIterator;
using search::queryeval::ExecuteInfo;
namespace {
struct Fixture {
FieldSpecBase field;
AttributeVector::SP attribute;
SimplePredicateQuery query;
using IntervalRange = PredicateAttribute::IntervalRange;
Fixture()
: field(42, 0),
attribute(std::make_shared<PredicateAttribute>("f")),
query(std::make_unique<PredicateQueryTerm>(),"view", 0, Weight(1))
{
query.getTerm()->addFeature("key", "value");
query.getTerm()->addRangeFeature("range_key", 42);
}
PredicateAttribute & guard() {
return dynamic_cast<PredicateAttribute &>(*attribute);
}
PredicateIndex & index() {
return predicate().getIndex();
}
PredicateAttribute & predicate() { return static_cast<PredicateAttribute &>(*attribute); }
void resize(uint32_t doc_id) {
while (predicate().getNumDocs() <= doc_id) {
uint32_t tmp;
predicate().addDoc(tmp);
PredicateAttribute::MinFeatureHandle mfh = predicate().getMinFeatureVector();
const_cast<uint8_t *>(mfh.first)[tmp] = 0;
}
}
void setIntervalRange(uint32_t doc_id, IntervalRange interval_range) {
const_cast<IntervalRange *>(predicate().getIntervalRangeVector())[doc_id] = interval_range;
}
void indexEmptyDocument(uint32_t doc_id, IntervalRange ir = 0x1) {
resize(doc_id);
index().indexEmptyDocument(doc_id);
setIntervalRange(doc_id, ir);
predicate().updateMaxIntervalRange(ir);
predicate().commit(false);
}
void indexDocument(uint32_t doc_id, const PredicateTreeAnnotations &annotations, IntervalRange ir = 0xffff) {
resize(doc_id);
index().indexDocument(doc_id, annotations);
setIntervalRange(doc_id, ir);
predicate().updateMaxIntervalRange(ir);
predicate().commit(false);
}
};
TEST_F("require that blueprint with empty index estimates empty.", Fixture) {
PredicateBlueprint blueprint(f.field, f.guard(), f.query);
EXPECT_TRUE(blueprint.getState().estimate().empty);
EXPECT_EQUAL(0u, blueprint.getState().estimate().estHits);
}
TEST_F("require that blueprint with zero-constraint doc estimates non-empty.", Fixture) {
f.indexEmptyDocument(42);
PredicateBlueprint blueprint(f.field, f.guard(), f.query);
EXPECT_FALSE(blueprint.getState().estimate().empty);
EXPECT_EQUAL(1u, blueprint.getState().estimate().estHits);
}
const int min_feature = 1;
const uint32_t doc_id = 2;
const uint32_t interval = 0x0001ffff;
TEST_F("require that blueprint with posting list entry estimates non-empty.", Fixture) {
PredicateTreeAnnotations annotations(min_feature);
annotations.interval_map[PredicateHash::hash64("key=value")] = std::vector<Interval>{{interval}};
f.indexDocument(doc_id, annotations);
PredicateBlueprint blueprint(f.field, f.guard(), f.query);
EXPECT_FALSE(blueprint.getState().estimate().empty);
EXPECT_EQUAL(0u, blueprint.getState().estimate().estHits);
}
TEST_F("require that blueprint with 'bounds' posting list entry estimates non-empty.", Fixture) {
PredicateTreeAnnotations annotations(min_feature);
annotations.bounds_map[PredicateHash::hash64("range_key=40")] =
std::vector<IntervalWithBounds>{{interval, 0x80000003}};
f.indexDocument(doc_id, annotations);
PredicateBlueprint blueprint(f.field, f.guard(), f.query);
EXPECT_FALSE(blueprint.getState().estimate().empty);
EXPECT_EQUAL(0u, blueprint.getState().estimate().estHits);
}
TEST_F("require that blueprint with zstar-compressed estimates non-empty.", Fixture) {
PredicateTreeAnnotations annotations(1);
annotations.interval_map[Constants::z_star_compressed_hash] = std::vector<Interval>{{0xfffe0000}};
f.indexDocument(doc_id, annotations);
PredicateBlueprint blueprint(f.field, f.guard(), f.query);
EXPECT_FALSE(blueprint.getState().estimate().empty);
EXPECT_EQUAL(0u, blueprint.getState().estimate().estHits);
}
void
runQuery(Fixture & f, std::vector<uint32_t> expected, bool expectCachedSize, uint32_t expectedKV) {
PredicateBlueprint blueprint(f.field, f.guard(), f.query);
blueprint.fetchPostings(ExecuteInfo::TRUE);
EXPECT_EQUAL(expectCachedSize, blueprint.getCachedFeatures().size());
for (uint32_t docId : expected) {
EXPECT_EQUAL(expectedKV, uint32_t(blueprint.getKV()[docId]));
}
TermFieldMatchDataArray tfmda;
SearchIterator::UP it = blueprint.createLeafSearch(tfmda, true);
ASSERT_TRUE(it.get());
it->initFullRange();
EXPECT_EQUAL(SearchIterator::beginId(), it->getDocId());
std::vector<uint32_t> actual;
for (it->seek(1); ! it->isAtEnd(); it->seek(it->getDocId()+1)) {
actual.push_back(it->getDocId());
}
EXPECT_EQUAL(expected.size(), actual.size());
for (size_t i(0); i < expected.size(); i++) {
EXPECT_EQUAL(expected[i], actual[i]);
}
}
TEST_F("require that blueprint can create search", Fixture) {
PredicateTreeAnnotations annotations(1);
annotations.interval_map[PredicateHash::hash64("key=value")] = std::vector<Interval>{{interval}};
for (size_t i(0); i < 9; i++) {
f.indexDocument(doc_id + i, annotations);
}
runQuery(f, {2,3,4,5,6,7,8,9,10}, 0, 1);
f.indexDocument(doc_id+9, annotations);
runQuery(f, {2, 3,4,5,6,7,8,9,10,11}, 0, 1);
f.index().requireCachePopulation();
f.indexDocument(doc_id+10, annotations);
runQuery(f, {2,3,4,5,6,7,8,9,10,11,12}, 1, 1);
}
TEST_F("require that blueprint can create more advanced search", Fixture) {
PredicateTreeAnnotations annotations(2);
annotations.interval_map[PredicateHash::hash64("key=value")] =
std::vector<Interval>{{0x00010001}};
annotations.bounds_map[PredicateHash::hash64("range_key=40")] =
std::vector<IntervalWithBounds>{{0x00020010, 0x40000005}}; // [40..44]
f.indexDocument(doc_id, annotations, 0x10);
f.indexEmptyDocument(doc_id + 2);
PredicateBlueprint blueprint(f.field, f.guard(), f.query);
blueprint.fetchPostings(ExecuteInfo::TRUE);
TermFieldMatchDataArray tfmda;
SearchIterator::UP it = blueprint.createLeafSearch(tfmda, true);
ASSERT_TRUE(it.get());
it->initFullRange();
EXPECT_EQUAL(SearchIterator::beginId(), it->getDocId());
EXPECT_FALSE(it->seek(doc_id - 1));
EXPECT_EQUAL(doc_id, it->getDocId());
EXPECT_TRUE(it->seek(doc_id));
EXPECT_EQUAL(doc_id, it->getDocId());
EXPECT_FALSE(it->seek(doc_id + 1));
EXPECT_EQUAL(doc_id + 2, it->getDocId());
EXPECT_TRUE(it->seek(doc_id + 2));
EXPECT_FALSE(it->seek(doc_id + 3));
EXPECT_TRUE(it->isAtEnd());
}
TEST_F("require that blueprint can create NOT search", Fixture) {
PredicateTreeAnnotations annotations(1);
annotations.interval_map[Constants::z_star_hash] =std::vector<Interval>{{0x00010000}, {0xffff0001}};
f.indexDocument(doc_id, annotations);
PredicateBlueprint blueprint(f.field, f.guard(), f.query);
blueprint.fetchPostings(ExecuteInfo::TRUE);
TermFieldMatchDataArray tfmda;
SearchIterator::UP it = blueprint.createLeafSearch(tfmda, true);
ASSERT_TRUE(it.get());
it->initFullRange();
EXPECT_TRUE(it->seek(doc_id));
EXPECT_EQUAL(doc_id, it->getDocId());
EXPECT_FALSE(it->seek(doc_id + 1));
}
TEST_F("require that blueprint can create compressed NOT search", Fixture) {
PredicateTreeAnnotations annotations(1);
annotations.interval_map[Constants::z_star_compressed_hash] =std::vector<Interval>{{0xfffe0000}};
f.indexDocument(doc_id, annotations);
PredicateBlueprint blueprint(f.field, f.guard(), f.query);
blueprint.fetchPostings(ExecuteInfo::TRUE);
TermFieldMatchDataArray tfmda;
SearchIterator::UP it = blueprint.createLeafSearch(tfmda, true);
ASSERT_TRUE(it.get());
it->initFullRange();
EXPECT_TRUE(it->seek(doc_id));
EXPECT_EQUAL(doc_id, it->getDocId());
EXPECT_FALSE(it->seek(doc_id + 1));
}
TEST_F("require that blueprint can set up search with subqueries", Fixture) {
PredicateTreeAnnotations annotations(2);
annotations.interval_map[PredicateHash::hash64("key=value")] =
std::vector<Interval>{{0x00010001}};
annotations.interval_map[PredicateHash::hash64("key2=value")] =
std::vector<Interval>{{0x0002ffff}};
f.indexDocument(doc_id, annotations);
SimplePredicateQuery query(std::make_unique<PredicateQueryTerm>(),
"view", 0, Weight(1));
query.getTerm()->addFeature("key", "value", 1);
query.getTerm()->addFeature("key2", "value", 2);
PredicateBlueprint blueprint(f.field, f.guard(), query);
blueprint.fetchPostings(ExecuteInfo::TRUE);
TermFieldMatchDataArray tfmda;
SearchIterator::UP it = blueprint.createLeafSearch(tfmda, true);
ASSERT_TRUE(it.get());
it->initFullRange();
EXPECT_FALSE(it->seek(doc_id));
}
} // namespace
TEST_MAIN() { TEST_RUN_ALL(); }
|
