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
|
// Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "attribute_weighted_set_blueprint.h"
#include <vespa/searchcommon/attribute/i_search_context.h>
#include <vespa/searchlib/queryeval/weighted_set_term_search.h>
#include <vespa/searchlib/query/queryterm.h>
#include <vespa/searchlib/common/bitvector.h>
#include <vespa/vespalib/stllike/hash_map.h>
#include <vespa/searchlib/fef/matchdatalayout.h>
namespace search {
namespace {
using attribute::ISearchContext;
using attribute::IAttributeVector;
//-----------------------------------------------------------------------------
class UseAttr
{
private:
const attribute::IAttributeVector &_attr;
protected:
const attribute::IAttributeVector &attribute() const { return _attr; }
public:
UseAttr(const attribute::IAttributeVector & attr)
: _attr(attr) {}
};
//-----------------------------------------------------------------------------
class UseStringEnum : public UseAttr
{
public:
UseStringEnum(const IAttributeVector & attr)
: UseAttr(attr) {}
bool mapToken(const ISearchContext &context, int64_t &token) const
{
attribute::IAttributeVector::EnumHandle handle;
if (attribute().findEnum(context.queryTerm().getTerm(), handle)) {
token = handle;
return true;
}
return false;
}
int64_t getToken(uint32_t docId) const {
return attribute().getEnum(docId);
}
};
//-----------------------------------------------------------------------------
class UseInteger : public UseAttr
{
public:
UseInteger(const IAttributeVector & attr) : UseAttr(attr) {}
bool mapToken(const ISearchContext &context, int64_t &token) const
{
Int64Range range(context.getAsIntegerTerm());
if (range.isPoint()) {
token = range.lower();
return true;
}
return false;
}
int64_t getToken(uint32_t docId) const {
return attribute().getInt(docId);
}
};
//-----------------------------------------------------------------------------
template <typename T>
class AttributeFilter final : public queryeval::SearchIterator
{
private:
typedef vespalib::hash_map<int64_t, int32_t> Map;
typedef fef::TermFieldMatchData TFMD;
TFMD &_tfmd;
T _attr;
Map _map;
int32_t _weight;
public:
AttributeFilter(fef::TermFieldMatchData &tfmd,
const IAttributeVector & attr,
const std::vector<int32_t> & weights,
const std::vector<ISearchContext*> & contexts)
: _tfmd(tfmd), _attr(attr), _map(), _weight(0)
{
for (size_t i = 0; i < contexts.size(); ++i) {
int64_t token(0);
if (_attr.mapToken(*contexts[i], token)) {
_map[token] = weights[i];
}
}
}
void and_hits_into(BitVector & result,uint32_t begin_id) override {
Map::iterator end = _map.end();
result.foreach_truebit([&, end](uint32_t key) { if ( _map.find(_attr.getToken(key)) == end) { result.clearBit(key); }}, begin_id);
}
void doSeek(uint32_t docId) override {
Map::const_iterator pos = _map.find(_attr.getToken(docId));
if (pos != _map.end()) {
_weight = pos->second;
setDocId(docId);
}
}
void doUnpack(uint32_t docId) override {
_tfmd.reset(docId);
fef::TermFieldMatchDataPosition pos;
pos.setElementWeight(_weight);
_tfmd.appendPosition(pos);
}
void visitMembers(vespalib::ObjectVisitor &) const override {}
};
//-----------------------------------------------------------------------------
} // namespace search::<unnamed>
AttributeWeightedSetBlueprint::AttributeWeightedSetBlueprint(const queryeval::FieldSpec &field, const IAttributeVector & attr)
: queryeval::ComplexLeafBlueprint(field),
_numDocs(attr.getNumDocs()),
_estHits(0),
_weights(),
_attr(attr),
_contexts()
{
set_allow_termwise_eval(true);
}
AttributeWeightedSetBlueprint::~AttributeWeightedSetBlueprint()
{
while (!_contexts.empty()) {
delete _contexts.back();
_contexts.pop_back();
}
}
void
AttributeWeightedSetBlueprint::addToken(std::unique_ptr<ISearchContext> context, int32_t weight)
{
_estHits = std::min(_estHits + context->approximateHits(), _numDocs);
setEstimate(HitEstimate(_estHits, (_estHits == 0)));
_weights.push_back(weight);
_contexts.push_back(context.get());
context.release();
}
queryeval::SearchIterator::UP
AttributeWeightedSetBlueprint::createLeafSearch(const fef::TermFieldMatchDataArray &tfmda, bool strict) const
{
assert(tfmda.size() == 1);
fef::TermFieldMatchData &tfmd = *tfmda[0];
if (strict) { // use generic weighted set search
fef::MatchDataLayout layout;
auto handle = layout.allocTermField(tfmd.getFieldId());
auto match_data = layout.createMatchData();
auto child_tfmd = match_data->resolveTermField(handle);
std::vector<queryeval::SearchIterator*> children(_contexts.size());
for (size_t i = 0; i < _contexts.size(); ++i) {
children[i] = _contexts[i]->createIterator(child_tfmd, true).release();
}
return queryeval::SearchIterator::UP(queryeval::WeightedSetTermSearch::create(children, tfmd, _weights, std::move(match_data)));
} else { // use attribute filter optimization
bool isSingleValue = !_attr.hasMultiValue();
bool isString = (_attr.isStringType() && _attr.hasEnum());
bool isInteger = _attr.isIntegerType();
assert(isSingleValue);
(void) isSingleValue;
if (isString) {
return queryeval::SearchIterator::UP(new AttributeFilter<UseStringEnum>(tfmd, _attr, _weights, _contexts));
} else {
assert(isInteger);
(void) isInteger;
return queryeval::SearchIterator::UP(new AttributeFilter<UseInteger>(tfmd, _attr, _weights, _contexts));
}
}
}
void
AttributeWeightedSetBlueprint::fetchPostings(bool strict, const BitVector * filter)
{
if (strict) {
for (size_t i = 0; i < _contexts.size(); ++i) {
_contexts[i]->fetchPostings(true, filter);
}
}
}
} // namespace search
|
