Coverage Report

Created: 2026-06-09 13:51

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
be/src/storage/rowset/beta_rowset_reader.cpp
Line
Count
Source
1
// Licensed to the Apache Software Foundation (ASF) under one
2
// or more contributor license agreements.  See the NOTICE file
3
// distributed with this work for additional information
4
// regarding copyright ownership.  The ASF licenses this file
5
// to you under the Apache License, Version 2.0 (the
6
// "License"); you may not use this file except in compliance
7
// with the License.  You may obtain a copy of the License at
8
//
9
//   http://www.apache.org/licenses/LICENSE-2.0
10
//
11
// Unless required by applicable law or agreed to in writing,
12
// software distributed under the License is distributed on an
13
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
14
// KIND, either express or implied.  See the License for the
15
// specific language governing permissions and limitations
16
// under the License.
17
18
#include "storage/rowset/beta_rowset_reader.h"
19
20
#include <stddef.h>
21
22
#include <algorithm>
23
#include <memory>
24
#include <ostream>
25
#include <roaring/roaring.hh>
26
#include <set>
27
#include <string>
28
#include <unordered_map>
29
#include <utility>
30
31
#include "common/logging.h"
32
#include "common/status.h"
33
#include "core/block/block.h"
34
#include "io/io_common.h"
35
#include "runtime/descriptors.h"
36
#include "runtime/runtime_profile.h"
37
#include "storage/delete/delete_handler.h"
38
#include "storage/iterator/vgeneric_iterators.h"
39
#include "storage/olap_define.h"
40
#include "storage/predicate/block_column_predicate.h"
41
#include "storage/predicate/column_predicate.h"
42
#include "storage/row_cursor.h"
43
#include "storage/rowset/rowset_meta.h"
44
#include "storage/rowset/rowset_reader_context.h"
45
#include "storage/schema.h"
46
#include "storage/segment/lazy_init_segment_iterator.h"
47
#include "storage/segment/segment.h"
48
#include "storage/tablet/tablet_meta.h"
49
#include "storage/tablet/tablet_schema.h"
50
51
namespace doris {
52
using namespace ErrorCode;
53
54
BetaRowsetReader::BetaRowsetReader(BetaRowsetSharedPtr rowset)
55
914
        : _read_context(nullptr), _rowset(std::move(rowset)), _stats(&_owned_stats) {
56
914
    _rowset->acquire();
57
914
}
58
59
947
void BetaRowsetReader::reset_read_options() {
60
947
    _read_options.delete_condition_predicates = AndBlockColumnPredicate::create_shared();
61
947
    _read_options.column_predicates.clear();
62
947
    _read_options.col_id_to_predicates.clear();
63
947
    _read_options.del_predicates_for_zone_map.clear();
64
947
    _read_options.key_ranges.clear();
65
947
}
66
67
0
RowsetReaderSharedPtr BetaRowsetReader::clone() {
68
0
    return RowsetReaderSharedPtr(new BetaRowsetReader(_rowset));
69
0
}
70
71
0
void BetaRowsetReader::update_profile(RuntimeProfile* profile) {
72
0
    if (_iterator != nullptr) {
73
0
        _iterator->update_profile(profile);
74
0
    }
75
0
}
76
77
Status BetaRowsetReader::get_segment_iterators(RowsetReaderContext* read_context,
78
                                               std::vector<RowwiseIteratorUPtr>* out_iters,
79
1.19k
                                               bool use_cache) {
80
1.19k
    _read_context = read_context;
81
    // The segment iterator is created with its own statistics,
82
    // and the member variable '_stats'  is initialized by '_stats(&owned_stats)'.
83
    // The choice of statistics used depends on the workload of the rowset reader.
84
    // For instance, if it's for query, the get_segment_iterators function
85
    // will receive one valid read_context with corresponding valid statistics,
86
    // and we will use those statistics.
87
    // However, for compaction or schema change workloads,
88
    // the read_context passed to the function will have null statistics,
89
    // and in such cases we will try to use the beta rowset reader's own statistics.
90
1.19k
    if (_read_context->stats != nullptr) {
91
1.09k
        _stats = _read_context->stats;
92
1.09k
    }
93
1.19k
    SCOPED_RAW_TIMER(&_stats->rowset_reader_get_segment_iterators_timer_ns);
94
95
1.19k
    RETURN_IF_ERROR(_rowset->load());
96
97
    // convert RowsetReaderContext to StorageReadOptions
98
1.19k
    _read_options.block_row_max = read_context->batch_size;
99
1.19k
    _read_options.preferred_block_size_bytes = read_context->preferred_block_size_bytes;
100
1.19k
    _read_options.stats = _stats;
101
1.19k
    _read_options.push_down_agg_type_opt = _read_context->push_down_agg_type_opt;
102
1.19k
    _read_options.common_expr_ctxs_push_down = _read_context->common_expr_ctxs_push_down;
103
1.19k
    _read_options.project_columns = _read_context->origin_return_columns != nullptr
104
1.19k
                                            ? _read_context->origin_return_columns
105
1.19k
                                            : _read_context->return_columns;
106
1.19k
    _read_options.virtual_column_exprs = _read_context->virtual_column_exprs;
107
108
1.19k
    _read_options.all_access_paths = _read_context->all_access_paths;
109
1.19k
    _read_options.predicate_access_paths = _read_context->predicate_access_paths;
110
111
1.19k
    _read_options.ann_topn_runtime = _read_context->ann_topn_runtime;
112
1.19k
    _read_options.vir_cid_to_idx_in_block = _read_context->vir_cid_to_idx_in_block;
113
1.19k
    _read_options.vir_col_idx_to_type = _read_context->vir_col_idx_to_type;
114
1.19k
    _read_options.score_runtime = _read_context->score_runtime;
115
1.19k
    _read_options.collection_statistics = _read_context->collection_statistics;
116
1.19k
    _read_options.rowset_id = _rowset->rowset_id();
117
1.19k
    _read_options.version = _rowset->version();
118
1.19k
    _read_options.commit_tso = _rowset->rowset_meta()->commit_tso();
119
1.19k
    _read_options.tablet_id = _rowset->rowset_meta()->tablet_id();
120
1.19k
    _read_options.read_limit = _topn_limit;
121
1.19k
    if (_read_context->lower_bound_keys != nullptr) {
122
1.09k
        for (int i = 0; i < _read_context->lower_bound_keys->size(); ++i) {
123
0
            _read_options.key_ranges.emplace_back(&_read_context->lower_bound_keys->at(i),
124
0
                                                  _read_context->is_lower_keys_included->at(i),
125
0
                                                  &_read_context->upper_bound_keys->at(i),
126
0
                                                  _read_context->is_upper_keys_included->at(i));
127
0
        }
128
1.09k
    }
129
130
    // delete_hanlder is always set, but it maybe not init, so that it will return empty conditions
131
    // or predicates when it is not inited.
132
1.19k
    if (_read_context->delete_handler != nullptr) {
133
1.09k
        _read_context->delete_handler->get_delete_conditions_after_version(
134
1.09k
                _rowset->end_version(), _read_options.delete_condition_predicates.get(),
135
1.09k
                &_read_options.del_predicates_for_zone_map);
136
1.09k
    }
137
138
1.19k
    std::vector<uint32_t> read_columns;
139
1.19k
    std::set<uint32_t> read_columns_set;
140
1.19k
    std::set<uint32_t> delete_columns_set;
141
4.92k
    for (int i = 0; i < _read_context->return_columns->size(); ++i) {
142
3.72k
        read_columns.push_back(_read_context->return_columns->at(i));
143
3.72k
        read_columns_set.insert(_read_context->return_columns->at(i));
144
3.72k
    }
145
1.19k
    _read_options.delete_condition_predicates->get_all_column_ids(delete_columns_set);
146
1.19k
    for (auto cid : delete_columns_set) {
147
406
        if (read_columns_set.find(cid) == read_columns_set.end()) {
148
254
            read_columns.push_back(cid);
149
254
        }
150
406
    }
151
    // disable condition cache if you have delete condition
152
1.19k
    _read_context->condition_cache_digest =
153
1.19k
            delete_columns_set.empty() ? _read_context->condition_cache_digest : 0;
154
    // create segment iterators
155
1.19k
    VLOG_NOTICE << "read columns size: " << read_columns.size();
156
1.19k
    _input_schema = std::make_shared<Schema>(_read_context->tablet_schema->columns(), read_columns);
157
    // output_schema only contains return_columns (excludes extra columns like delete-predicate columns).
158
    // It is used by merge/union iterators to determine how many columns to copy to the output block.
159
1.19k
    _output_schema = std::make_shared<Schema>(_read_context->tablet_schema->columns(),
160
1.19k
                                              *(_read_context->return_columns));
161
1.19k
    if (_read_context->predicates != nullptr) {
162
1.09k
        _read_options.column_predicates.insert(_read_options.column_predicates.end(),
163
1.09k
                                               _read_context->predicates->begin(),
164
1.09k
                                               _read_context->predicates->end());
165
1.09k
        for (auto pred : *(_read_context->predicates)) {
166
0
            if (_read_options.col_id_to_predicates.count(pred->column_id()) < 1) {
167
0
                _read_options.col_id_to_predicates.insert(
168
0
                        {pred->column_id(), AndBlockColumnPredicate::create_shared()});
169
0
            }
170
0
            _read_options.col_id_to_predicates[pred->column_id()]->add_column_predicate(
171
0
                    SingleColumnBlockPredicate::create_unique(pred));
172
0
        }
173
1.09k
    }
174
175
    // Take a delete-bitmap for each segment, the bitmap contains all deletes
176
    // until the max read version, which is read_context->version.second
177
1.19k
    if (_read_context->delete_bitmap != nullptr) {
178
5
        {
179
5
            SCOPED_RAW_TIMER(&_stats->delete_bitmap_get_agg_ns);
180
5
            RowsetId rowset_id = rowset()->rowset_id();
181
39
            for (uint32_t seg_id = 0; seg_id < rowset()->num_segments(); ++seg_id) {
182
34
                auto d = _read_context->delete_bitmap->get_agg(
183
34
                        {rowset_id, seg_id, _read_context->version.second});
184
34
                if (d->isEmpty()) {
185
11
                    continue; // Empty delete bitmap for the segment
186
11
                }
187
23
                VLOG_TRACE << "Get the delete bitmap for rowset: " << rowset_id.to_string()
188
0
                           << ", segment id:" << seg_id << ", size:" << d->cardinality();
189
23
                _read_options.delete_bitmap.emplace(seg_id, std::move(d));
190
23
            }
191
5
        }
192
5
    }
193
194
1.19k
    if (_should_push_down_value_predicates()) {
195
        // sequence mapping currently only support merge on read, so can not push down value predicates
196
603
        if (_read_context->value_predicates != nullptr &&
197
603
            !read_context->tablet_schema->has_seq_map()) {
198
538
            _read_options.column_predicates.insert(_read_options.column_predicates.end(),
199
538
                                                   _read_context->value_predicates->begin(),
200
538
                                                   _read_context->value_predicates->end());
201
538
            for (auto pred : *(_read_context->value_predicates)) {
202
0
                if (_read_options.col_id_to_predicates.count(pred->column_id()) < 1) {
203
0
                    _read_options.col_id_to_predicates.insert(
204
0
                            {pred->column_id(), AndBlockColumnPredicate::create_shared()});
205
0
                }
206
0
                _read_options.col_id_to_predicates[pred->column_id()]->add_column_predicate(
207
0
                        SingleColumnBlockPredicate::create_unique(pred));
208
0
            }
209
538
        }
210
603
    }
211
1.19k
    _read_options.use_page_cache = _read_context->use_page_cache;
212
1.19k
    _read_options.tablet_schema = _read_context->tablet_schema;
213
1.19k
    _read_options.enable_unique_key_merge_on_write =
214
1.19k
            _read_context->enable_unique_key_merge_on_write;
215
1.19k
    _read_options.record_rowids = _read_context->record_rowids;
216
1.19k
    _read_options.topn_filter_source_node_ids = _read_context->topn_filter_source_node_ids;
217
1.19k
    _read_options.topn_filter_target_node_id = _read_context->topn_filter_target_node_id;
218
1.19k
    _read_options.read_orderby_key_reverse = _read_context->read_orderby_key_reverse;
219
1.19k
    _read_options.use_insert_order_when_same = _read_context->use_insert_order_when_same;
220
1.19k
    _read_options.read_orderby_key_columns = _read_context->read_orderby_key_columns;
221
1.19k
    _read_options.io_ctx.reader_type = _read_context->reader_type;
222
1.19k
    _read_options.io_ctx.file_cache_stats = &_stats->file_cache_stats;
223
1.19k
    _read_options.runtime_state = _read_context->runtime_state;
224
1.19k
    _read_options.output_columns = _read_context->output_columns;
225
1.19k
    _read_options.io_ctx.reader_type = _read_context->reader_type;
226
1.19k
    _read_options.io_ctx.is_disposable = _read_context->reader_type != ReaderType::READER_QUERY;
227
1.19k
    _read_options.target_cast_type_for_variants = _read_context->target_cast_type_for_variants;
228
1.19k
    if (_read_context->runtime_state != nullptr) {
229
0
        _read_options.io_ctx.query_id = &_read_context->runtime_state->query_id();
230
0
        _read_options.io_ctx.read_file_cache =
231
0
                _read_context->runtime_state->query_options().enable_file_cache;
232
0
        _read_options.io_ctx.is_disposable =
233
0
                _read_context->runtime_state->query_options().disable_file_cache;
234
0
    }
235
236
1.19k
    if (_read_context->condition_cache_digest) {
237
0
        for (const auto& key_range : _read_options.key_ranges) {
238
0
            _read_context->condition_cache_digest =
239
0
                    key_range.get_digest(_read_context->condition_cache_digest);
240
0
        }
241
0
        _read_options.condition_cache_digest = _read_context->condition_cache_digest;
242
0
    }
243
244
1.19k
    _read_options.io_ctx.expiration_time = read_context->ttl_seconds;
245
246
1.19k
    bool enable_segment_cache = true;
247
1.19k
    auto* state = read_context->runtime_state;
248
1.19k
    if (state != nullptr) {
249
0
        enable_segment_cache = state->query_options().__isset.enable_segment_cache
250
0
                                       ? state->query_options().enable_segment_cache
251
0
                                       : true;
252
0
    }
253
    // When reader type is for query, session variable `enable_segment_cache` should be respected.
254
1.19k
    bool should_use_cache = use_cache || (_read_context->reader_type == ReaderType::READER_QUERY &&
255
1.19k
                                          enable_segment_cache);
256
257
1.19k
    auto segment_count = _rowset->num_segments();
258
1.19k
    auto [seg_start, seg_end] = _segment_offsets;
259
    // If seg_start == seg_end, it means that the segments of a rowset is not
260
    // split scanned by multiple scanners, and the rowset reader is used to read the whole rowset.
261
1.19k
    if (seg_start == seg_end) {
262
1.19k
        seg_start = 0;
263
1.19k
        seg_end = segment_count;
264
1.19k
    }
265
1.19k
    if (_read_context->record_rowids && _read_context->rowid_conversion) {
266
        // init segment rowid map for rowid conversion
267
398
        std::vector<uint32_t> segment_rows;
268
398
        RETURN_IF_ERROR(_rowset->get_segment_num_rows(&segment_rows, should_use_cache, _stats));
269
398
        RETURN_IF_ERROR(_read_context->rowid_conversion->init_segment_map(rowset()->rowset_id(),
270
398
                                                                          segment_rows));
271
398
    }
272
273
3.98k
    for (int64_t i = seg_start; i < seg_end; i++) {
274
2.79k
        SCOPED_RAW_TIMER(&_stats->rowset_reader_create_iterators_timer_ns);
275
2.79k
        std::unique_ptr<RowwiseIterator> iter;
276
277
        /// For iterators, we don't need to initialize them all at once when creating them.
278
        /// Instead, we should initialize each iterator separately when really using them.
279
        /// This optimization minimizes the lifecycle of resources like column readers
280
        /// and prevents excessive memory consumption, especially for wide tables.
281
2.79k
        if (_segment_row_ranges.empty()) {
282
2.79k
            _read_options.row_ranges.clear();
283
2.79k
            iter = std::make_unique<LazyInitSegmentIterator>(_rowset, i, should_use_cache,
284
2.79k
                                                             _input_schema, _read_options);
285
2.79k
        } else {
286
0
            DCHECK_EQ(seg_end - seg_start, _segment_row_ranges.size());
287
0
            auto local_options = _read_options;
288
0
            local_options.row_ranges = _segment_row_ranges[i - seg_start];
289
0
            if (local_options.condition_cache_digest) {
290
0
                local_options.condition_cache_digest =
291
0
                        local_options.row_ranges.get_digest(local_options.condition_cache_digest);
292
0
            }
293
0
            iter = std::make_unique<LazyInitSegmentIterator>(_rowset, i, should_use_cache,
294
0
                                                             _input_schema, local_options);
295
0
        }
296
297
2.79k
        if (iter->empty()) {
298
0
            continue;
299
0
        }
300
2.79k
        out_iters->push_back(std::move(iter));
301
2.79k
    }
302
303
1.19k
    return Status::OK();
304
1.19k
}
305
306
247
Status BetaRowsetReader::init(RowsetReaderContext* read_context, const RowSetSplits& rs_splits) {
307
247
    _read_context = read_context;
308
247
    _read_context->rowset_id = _rowset->rowset_id();
309
247
    _segment_offsets = rs_splits.segment_offsets;
310
247
    _segment_row_ranges = rs_splits.segment_row_ranges;
311
247
    return Status::OK();
312
247
}
313
314
6.63k
Status BetaRowsetReader::_init_iterator_once() {
315
6.63k
    return _init_iter_once.call([this] { return _init_iterator(); });
316
6.63k
}
317
318
247
Status BetaRowsetReader::_init_iterator() {
319
247
    std::vector<RowwiseIteratorUPtr> iterators;
320
247
    RETURN_IF_ERROR(get_segment_iterators(_read_context, &iterators));
321
322
247
    SCOPED_RAW_TIMER(&_stats->rowset_reader_init_iterators_timer_ns);
323
324
247
    if (_read_context->merged_rows == nullptr) {
325
103
        _read_context->merged_rows = &_merged_rows;
326
103
    }
327
    // merge or union segment iterator
328
247
    if (is_merge_iterator()) {
329
8
        auto sequence_loc = -1;
330
8
        if (_read_context->sequence_id_idx != -1) {
331
0
            for (int loc = 0; loc < _read_context->return_columns->size(); loc++) {
332
0
                if (_read_context->return_columns->at(loc) == _read_context->sequence_id_idx) {
333
0
                    sequence_loc = loc;
334
0
                    break;
335
0
                }
336
0
            }
337
0
        }
338
8
        _iterator = new_merge_iterator(std::move(iterators), sequence_loc, _read_context->is_unique,
339
8
                                       _read_context->read_orderby_key_reverse,
340
8
                                       _read_context->merged_rows, _output_schema);
341
239
    } else {
342
239
        if (_read_context->read_orderby_key_reverse) {
343
            // reverse iterators to read backward for ORDER BY key DESC
344
0
            std::reverse(iterators.begin(), iterators.end());
345
0
        }
346
239
        _iterator = new_union_iterator(std::move(iterators), _output_schema);
347
239
    }
348
349
247
    auto s = _iterator->init(_read_options);
350
247
    if (!s.ok()) {
351
0
        LOG(WARNING) << "failed to init iterator: " << s.to_string();
352
0
        _iterator.reset();
353
0
        return Status::Error<ROWSET_READER_INIT>(s.to_string());
354
0
    }
355
247
    return Status::OK();
356
247
}
357
358
1.19k
bool BetaRowsetReader::_should_push_down_value_predicates() const {
359
    // if unique table with rowset [0-x] or [0-1] [2-y] [...],
360
    // value column predicates can be pushdown on rowset [0-x] or [2-y], [2-y]
361
    // must be compaction, not overlapping and don't have sequence column
362
1.19k
    return _rowset->keys_type() == UNIQUE_KEYS &&
363
1.19k
           (((_rowset->start_version() == 0 || _rowset->start_version() == 2) &&
364
673
             !_rowset->_rowset_meta->is_segments_overlapping() &&
365
673
             _read_context->sequence_id_idx == -1) ||
366
673
            _read_context->enable_unique_key_merge_on_write ||
367
673
            _read_context->enable_mor_value_predicate_pushdown);
368
1.19k
}
369
} // namespace doris