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
|
/**
* 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.
*/
#ifndef ORC_SARGSAPPLIER_HH
#define ORC_SARGSAPPLIER_HH
#include <orc/Common.hh>
#include "orc/BloomFilter.hh"
#include "orc/Reader.hh"
#include "orc/Type.hh"
#include "wrap/orc-proto-wrapper.hh"
#include "sargs/SearchArgument.hh"
#include "SchemaEvolution.hh"
#include <unordered_map>
namespace orc {
class SargsApplier {
public:
SargsApplier(const Type& type, const SearchArgument* searchArgument, uint64_t rowIndexStride,
WriterVersion writerVersion, ReaderMetrics* metrics,
const SchemaEvolution* schemaEvolution = nullptr);
/**
* Evaluate search argument on file statistics
* If file statistics don't satisfy the sargs,
* the EvaluatedRowGroupCount of Reader Metrics will be updated.
* Otherwise, Reader Metrics will not be updated and
* will require further evaluation.
* @return true if file statistics satisfy the sargs
*/
bool evaluateFileStatistics(const proto::Footer& footer, uint64_t numRowGroupsInStripeRange);
/**
* Evaluate search argument on stripe statistics
* If stripe statistics don't satisfy the sargs,
* the EvaluatedRowGroupCount of Reader Metrics will be updated.
* Otherwise, Reader Metrics will not be updated and
* will require further evaluation.
* @return true if stripe statistics satisfy the sargs
*/
bool evaluateStripeStatistics(const proto::StripeStatistics& stripeStats,
uint64_t stripeRowGroupCount);
/**
* TODO: use proto::RowIndex and proto::BloomFilter to do the evaluation
* Pick the row groups that we need to load from the current stripe.
* @return true if any row group is selected
*/
bool pickRowGroups(uint64_t rowsInStripe,
const std::unordered_map<uint64_t, proto::RowIndex>& rowIndexes,
const std::map<uint32_t, BloomFilterIndex>& bloomFilters);
/**
* Return a vector of the next skipped row for each RowGroup. Each value is the row id
* in stripe. 0 means the current RowGroup is entirely skipped.
* Only valid after invoking pickRowGroups().
*/
const std::vector<uint64_t>& getNextSkippedRows() const {
return nextSkippedRows_;
}
/**
* Indicate whether any row group is selected in the last evaluation
*/
bool hasSelected() const {
return hasSelected_;
}
/**
* Indicate whether any row group is skipped in the last evaluation
*/
bool hasSkipped() const {
return hasSkipped_;
}
/**
* Whether any row group from current row in the stripe matches PPD.
*/
bool hasSelectedFrom(uint64_t currentRowInStripe) const {
uint64_t rg = currentRowInStripe / rowIndexStride_;
for (; rg < nextSkippedRows_.size(); ++rg) {
if (nextSkippedRows_[rg]) {
return true;
}
}
return false;
}
std::pair<uint64_t, uint64_t> getStats() const {
if (metrics_ != nullptr) {
return std::make_pair(metrics_->SelectedRowGroupCount.load(),
metrics_->EvaluatedRowGroupCount.load());
} else {
return {0, 0};
}
}
private:
// evaluate column statistics in the form of protobuf::RepeatedPtrField
typedef ::google::protobuf::RepeatedPtrField<proto::ColumnStatistics> PbColumnStatistics;
bool evaluateColumnStatistics(const PbColumnStatistics& colStats) const;
friend class TestSargsApplier_findColumnTest_Test;
friend class TestSargsApplier_findArrayColumnTest_Test;
friend class TestSargsApplier_findMapColumnTest_Test;
static uint64_t findColumn(const Type& type, const std::string& colName);
private:
const Type& type_;
const SearchArgument* searchArgument_;
const SchemaEvolution* schemaEvolution_;
uint64_t rowIndexStride_;
WriterVersion writerVersion_;
// column ids for each predicate leaf in the search argument
std::vector<uint64_t> filterColumns_;
// Map from RowGroup index to the next skipped row of the selected range it
// locates. If the RowGroup is not selected, set the value to 0.
// Calculated in pickRowGroups().
std::vector<uint64_t> nextSkippedRows_;
uint64_t totalRowsInStripe_;
bool hasSelected_;
bool hasSkipped_;
// store result of file stats evaluation
bool hasEvaluatedFileStats_;
bool fileStatsEvalResult_;
// use the SelectedRowGroupCount and EvaluatedRowGroupCount to
// keep stats of selected RGs and evaluated RGs
ReaderMetrics* metrics_;
};
} // namespace orc
#endif // ORC_SARGSAPPLIER_HH
|
