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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "same_element_blueprint.h"
#include "same_element_search.h"
#include "field_spec.hpp"
#include <vespa/searchlib/fef/termfieldmatchdata.h>
#include <vespa/searchlib/attribute/searchcontextelementiterator.h>
#include <vespa/vespalib/objects/visit.hpp>
#include <algorithm>
#include <map>
namespace search::queryeval {
SameElementBlueprint::SameElementBlueprint(const FieldSpec &field, bool expensive)
: ComplexLeafBlueprint(field),
_estimate(),
_layout(),
_terms(),
_field_name(field.getName())
{
if (expensive) {
set_cost_tier(State::COST_TIER_EXPENSIVE);
}
}
SameElementBlueprint::~SameElementBlueprint() = default;
FieldSpec
SameElementBlueprint::getNextChildField(const vespalib::string &field_name, uint32_t field_id)
{
return {field_name, field_id, _layout.allocTermField(field_id), false};
}
void
SameElementBlueprint::addTerm(Blueprint::UP term)
{
const State &childState = term->getState();
assert(childState.numFields() == 1);
HitEstimate childEst = childState.estimate();
if (_terms.empty() || (childEst < _estimate)) {
_estimate = childEst;
setEstimate(_estimate);
}
_terms.push_back(std::move(term));
}
void
SameElementBlueprint::sort(InFlow in_flow)
{
strict(in_flow.strict());
auto flow = AndFlow(in_flow);
for (auto &term: _terms) {
term->sort(InFlow(flow.strict(), flow.flow()));
flow.add(term->estimate());
}
}
FlowStats
SameElementBlueprint::calculate_flow_stats(uint32_t docid_limit) const
{
for (auto &term: _terms) {
term->update_flow_stats(docid_limit);
}
double est = AndFlow::estimate_of(_terms);
return {est,
AndFlow::cost_of(_terms, false) + est * _terms.size(),
AndFlow::cost_of(_terms, true) + est * _terms.size()};
}
void
SameElementBlueprint::optimize_self(OptimizePass pass)
{
if (pass == OptimizePass::LAST) {
std::sort(_terms.begin(), _terms.end(),
[](const auto &a, const auto &b) {
return (a->getState().estimate() < b->getState().estimate());
});
}
}
void
SameElementBlueprint::fetchPostings(const ExecuteInfo &execInfo)
{
if (_terms.empty()) return;
_terms[0]->fetchPostings(execInfo);
double hit_rate = execInfo.hit_rate() * _terms[0]->estimate();
for (size_t i = 1; i < _terms.size(); ++i) {
Blueprint & term = *_terms[i];
term.fetchPostings(ExecuteInfo::create(hit_rate, execInfo));
hit_rate = hit_rate * _terms[i]->estimate();
}
}
std::unique_ptr<SameElementSearch>
SameElementBlueprint::create_same_element_search(search::fef::TermFieldMatchData& tfmd) const
{
fef::MatchData::UP md = _layout.createMatchData();
std::vector<ElementIterator::UP> children(_terms.size());
for (size_t i = 0; i < _terms.size(); ++i) {
const State &childState = _terms[i]->getState();
SearchIterator::UP child = _terms[i]->createSearch(*md);
const attribute::ISearchContext *context = _terms[i]->get_attribute_search_context();
if (context == nullptr) {
children[i] = std::make_unique<ElementIteratorWrapper>(std::move(child), *childState.field(0).resolve(*md));
} else {
children[i] = std::make_unique<attribute::SearchContextElementIterator>(std::move(child), *context);
}
}
return std::make_unique<SameElementSearch>(tfmd, std::move(md), std::move(children), strict());
}
SearchIterator::UP
SameElementBlueprint::createLeafSearch(const search::fef::TermFieldMatchDataArray &tfmda) const
{
assert(tfmda.size() == 1);
return create_same_element_search(*tfmda[0]);
}
SearchIterator::UP
SameElementBlueprint::createFilterSearch(FilterConstraint constraint) const
{
return create_atmost_and_filter(_terms, strict(), constraint);
}
void
SameElementBlueprint::visitMembers(vespalib::ObjectVisitor &visitor) const
{
ComplexLeafBlueprint::visitMembers(visitor);
visit(visitor, "terms", _terms);
}
}
|
