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
|
/**
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "SargsApplier.hh"
#include <numeric>
namespace orc {
// find column id from column name
uint64_t SargsApplier::findColumn(const Type& type, const std::string& colName) {
for (uint64_t i = 0; i != type.getSubtypeCount(); ++i) {
// Only STRUCT type has field names
if (type.getKind() == STRUCT && type.getFieldName(i) == colName) {
return type.getSubtype(i)->getColumnId();
} else {
uint64_t ret = findColumn(*type.getSubtype(i), colName);
if (ret != INVALID_COLUMN_ID) {
return ret;
}
}
}
return INVALID_COLUMN_ID;
}
SargsApplier::SargsApplier(const Type& type, const SearchArgument* searchArgument,
uint64_t rowIndexStride, WriterVersion writerVersion,
ReaderMetrics* metrics, const SchemaEvolution* schemaEvolution)
: type_(type),
searchArgument_(searchArgument),
schemaEvolution_(schemaEvolution),
rowIndexStride_(rowIndexStride),
writerVersion_(writerVersion),
hasEvaluatedFileStats_(false),
fileStatsEvalResult_(true),
metrics_(metrics) {
const SearchArgumentImpl* sargs = dynamic_cast<const SearchArgumentImpl*>(searchArgument_);
// find the mapping from predicate leaves to columns
const std::vector<PredicateLeaf>& leaves = sargs->getLeaves();
filterColumns_.resize(leaves.size(), INVALID_COLUMN_ID);
for (size_t i = 0; i != filterColumns_.size(); ++i) {
if (leaves[i].hasColumnName()) {
filterColumns_[i] = findColumn(type, leaves[i].getColumnName());
} else {
filterColumns_[i] = leaves[i].getColumnId();
}
}
}
bool SargsApplier::pickRowGroups(uint64_t rowsInStripe,
const std::unordered_map<uint64_t, proto::RowIndex>& rowIndexes,
const std::map<uint32_t, BloomFilterIndex>& bloomFilters) {
// init state of each row group
uint64_t groupsInStripe = (rowsInStripe + rowIndexStride_ - 1) / rowIndexStride_;
nextSkippedRows_.resize(groupsInStripe);
totalRowsInStripe_ = rowsInStripe;
// row indexes do not exist, simply read all rows
if (rowIndexes.empty()) {
return true;
}
const auto& leaves = dynamic_cast<const SearchArgumentImpl*>(searchArgument_)->getLeaves();
std::vector<TruthValue> leafValues(leaves.size(), TruthValue::YES_NO_NULL);
hasSelected_ = false;
hasSkipped_ = false;
uint64_t nextSkippedRowGroup = groupsInStripe;
size_t rowGroup = groupsInStripe;
do {
--rowGroup;
for (size_t pred = 0; pred != leaves.size(); ++pred) {
uint64_t columnIdx = filterColumns_[pred];
auto rowIndexIter = rowIndexes.find(columnIdx);
if (columnIdx == INVALID_COLUMN_ID || rowIndexIter == rowIndexes.cend()) {
// this column does not exist in current file
leafValues[pred] = TruthValue::YES_NO_NULL;
} else if (schemaEvolution_ && !schemaEvolution_->isSafePPDConversion(columnIdx)) {
// cannot evaluate predicate when ppd is not safe
leafValues[pred] = TruthValue::YES_NO_NULL;
} else {
// get column statistics
const proto::ColumnStatistics& statistics =
rowIndexIter->second.entry(static_cast<int>(rowGroup)).statistics();
// get bloom filter
std::shared_ptr<BloomFilter> bloomFilter;
auto iter = bloomFilters.find(static_cast<uint32_t>(columnIdx));
if (iter != bloomFilters.cend()) {
bloomFilter = iter->second.entries.at(rowGroup);
}
leafValues[pred] = leaves[pred].evaluate(writerVersion_, statistics, bloomFilter.get());
}
}
bool needed = isNeeded(searchArgument_->evaluate(leafValues));
if (!needed) {
nextSkippedRows_[rowGroup] = 0;
nextSkippedRowGroup = rowGroup;
} else {
nextSkippedRows_[rowGroup] = (nextSkippedRowGroup == groupsInStripe)
? rowsInStripe
: (nextSkippedRowGroup * rowIndexStride_);
}
hasSelected_ |= needed;
hasSkipped_ |= !needed;
} while (rowGroup != 0);
// update stats
uint64_t selectedRGs = std::accumulate(
nextSkippedRows_.cbegin(), nextSkippedRows_.cend(), 0UL,
[](uint64_t initVal, uint64_t rg) { return rg > 0 ? initVal + 1 : initVal; });
if (metrics_ != nullptr) {
metrics_->SelectedRowGroupCount.fetch_add(selectedRGs);
metrics_->EvaluatedRowGroupCount.fetch_add(groupsInStripe);
}
return hasSelected_;
}
bool SargsApplier::evaluateColumnStatistics(const PbColumnStatistics& colStats) const {
const SearchArgumentImpl* sargs = dynamic_cast<const SearchArgumentImpl*>(searchArgument_);
if (sargs == nullptr) {
throw InvalidArgument("Failed to cast to SearchArgumentImpl");
}
const std::vector<PredicateLeaf>& leaves = sargs->getLeaves();
std::vector<TruthValue> leafValues(leaves.size(), TruthValue::YES_NO_NULL);
for (size_t pred = 0; pred != leaves.size(); ++pred) {
uint64_t columnId = filterColumns_[pred];
if (columnId != INVALID_COLUMN_ID && colStats.size() > static_cast<int>(columnId)) {
leafValues[pred] = leaves[pred].evaluate(writerVersion_,
colStats.Get(static_cast<int>(columnId)), nullptr);
}
}
return isNeeded(searchArgument_->evaluate(leafValues));
}
bool SargsApplier::evaluateStripeStatistics(const proto::StripeStatistics& stripeStats,
uint64_t stripeRowGroupCount) {
if (stripeStats.col_stats_size() == 0) {
return true;
}
bool ret = evaluateColumnStatistics(stripeStats.col_stats());
if (metrics_ != nullptr) {
metrics_->EvaluatedRowGroupCount.fetch_add(stripeRowGroupCount);
}
if (!ret) {
// reset mNextSkippedRows when the current stripe does not satisfy the PPD
nextSkippedRows_.clear();
}
return ret;
}
bool SargsApplier::evaluateFileStatistics(const proto::Footer& footer,
uint64_t numRowGroupsInStripeRange) {
if (!hasEvaluatedFileStats_) {
if (footer.statistics_size() == 0) {
fileStatsEvalResult_ = true;
} else {
fileStatsEvalResult_ = evaluateColumnStatistics(footer.statistics());
if (metrics_ != nullptr) {
metrics_->EvaluatedRowGroupCount.fetch_add(numRowGroupsInStripeRange);
}
}
hasEvaluatedFileStats_ = true;
}
return fileStatsEvalResult_;
}
} // namespace orc
|
