Coverage Report

Created: 2025-09-12 18:53

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/root/doris/be/src/olap/tablet_schema.h
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
#pragma once
19
20
#include <gen_cpp/Types_types.h>
21
#include <gen_cpp/olap_common.pb.h>
22
#include <gen_cpp/olap_file.pb.h>
23
#include <gen_cpp/segment_v2.pb.h>
24
#include <parallel_hashmap/phmap.h>
25
26
#include <algorithm>
27
#include <cstdint>
28
#include <map>
29
#include <memory>
30
#include <string>
31
#include <unordered_map>
32
#include <unordered_set>
33
#include <utility>
34
#include <vector>
35
36
#include "common/consts.h"
37
#include "common/status.h"
38
#include "olap/inverted_index_parser.h"
39
#include "olap/metadata_adder.h"
40
#include "olap/olap_common.h"
41
#include "olap/rowset/segment_v2/options.h"
42
#include "runtime/define_primitive_type.h"
43
#include "runtime/descriptors.h"
44
#include "runtime/memory/lru_cache_policy.h"
45
#include "util/debug_points.h"
46
#include "util/string_parser.hpp"
47
#include "util/string_util.h"
48
#include "vec/aggregate_functions/aggregate_function.h"
49
#include "vec/common/string_ref.h"
50
#include "vec/common/string_utils/string_utils.h"
51
#include "vec/core/types.h"
52
#include "vec/json/path_in_data.h"
53
54
namespace doris {
55
namespace vectorized {
56
class Block;
57
class PathInData;
58
class IDataType;
59
} // namespace vectorized
60
61
#include "common/compile_check_begin.h"
62
63
struct OlapTableIndexSchema;
64
class TColumn;
65
class TOlapTableIndex;
66
class TabletColumn;
67
68
using TabletColumnPtr = std::shared_ptr<TabletColumn>;
69
70
class TabletColumn : public MetadataAdder<TabletColumn> {
71
public:
72
    TabletColumn();
73
    TabletColumn(const ColumnPB& column);
74
    TabletColumn(const TColumn& column);
75
    TabletColumn(FieldAggregationMethod agg, FieldType type);
76
    TabletColumn(FieldAggregationMethod agg, FieldType filed_type, bool is_nullable);
77
    TabletColumn(FieldAggregationMethod agg, FieldType filed_type, bool is_nullable,
78
                 int32_t unique_id, size_t length);
79
80
#ifdef BE_TEST
81
60.9k
    virtual ~TabletColumn() = default;
82
#endif
83
84
    void init_from_pb(const ColumnPB& column);
85
    void init_from_thrift(const TColumn& column);
86
    void to_schema_pb(ColumnPB* column) const;
87
88
306k
    int32_t unique_id() const { return _unique_id; }
89
463
    void set_unique_id(int32_t id) { _unique_id = id; }
90
195k
    const std::string& name() const { return _col_name; }
91
21.5k
    const std::string& name_lower_case() const { return _col_name_lower_case; }
92
2.64k
    void set_name(std::string col_name) {
93
2.64k
        _col_name = col_name;
94
2.64k
        _col_name_lower_case = to_lower(_col_name);
95
2.64k
    }
96
1.76M
    MOCK_FUNCTION FieldType type() const { return _type; }
97
2.63k
    void set_type(FieldType type) { _type = type; }
98
92.4k
    bool is_key() const { return _is_key; }
99
286k
    bool is_nullable() const { return _is_nullable; }
100
0
    bool is_auto_increment() const { return _is_auto_increment; }
101
0
    bool is_seqeunce_col() const { return _col_name == SEQUENCE_COL; }
102
0
    bool is_on_update_current_timestamp() const { return _is_on_update_current_timestamp; }
103
74.0k
    bool is_variant_type() const { return _type == FieldType::OLAP_FIELD_TYPE_VARIANT; }
104
15.4k
    bool is_bf_column() const { return _is_bf_column; }
105
15.1k
    bool has_bitmap_index() const { return _has_bitmap_index; }
106
41.2k
    bool is_array_type() const { return _type == FieldType::OLAP_FIELD_TYPE_ARRAY; }
107
12.5k
    bool is_agg_state_type() const { return _type == FieldType::OLAP_FIELD_TYPE_AGG_STATE; }
108
0
    bool is_jsonb_type() const { return _type == FieldType::OLAP_FIELD_TYPE_JSONB; }
109
0
    bool is_length_variable_type() const {
110
0
        return _type == FieldType::OLAP_FIELD_TYPE_CHAR ||
111
0
               _type == FieldType::OLAP_FIELD_TYPE_VARCHAR ||
112
0
               _type == FieldType::OLAP_FIELD_TYPE_STRING ||
113
0
               _type == FieldType::OLAP_FIELD_TYPE_HLL ||
114
0
               _type == FieldType::OLAP_FIELD_TYPE_BITMAP ||
115
0
               _type == FieldType::OLAP_FIELD_TYPE_QUANTILE_STATE ||
116
0
               _type == FieldType::OLAP_FIELD_TYPE_AGG_STATE;
117
0
    }
118
    // Such columns are not exist in frontend schema info, so we need to
119
    // add them into tablet_schema for later column indexing.
120
    static TabletColumn create_materialized_variant_column(const std::string& root,
121
                                                           const std::vector<std::string>& paths,
122
                                                           int32_t parent_unique_id,
123
                                                           int32_t max_subcolumns_count);
124
193
    bool has_default_value() const { return _has_default_value; }
125
15.3k
    std::string default_value() const { return _default_value; }
126
45.2k
    int32_t length() const { return _length; }
127
1.04k
    void set_length(int32_t length) { _length = length; }
128
256
    void set_default_value(const std::string& default_value) {
129
256
        _default_value = default_value;
130
256
        _has_default_value = true;
131
256
    }
132
33.4k
    int32_t index_length() const { return _index_length; }
133
470
    void set_index_length(int32_t index_length) { _index_length = index_length; }
134
252
    void set_is_key(bool is_key) { _is_key = is_key; }
135
1.11k
    void set_is_nullable(bool is_nullable) { _is_nullable = is_nullable; }
136
0
    void set_is_auto_increment(bool is_auto_increment) { _is_auto_increment = is_auto_increment; }
137
0
    void set_is_on_update_current_timestamp(bool is_on_update_current_timestamp) {
138
0
        _is_on_update_current_timestamp = is_on_update_current_timestamp;
139
0
    }
140
    void set_path_info(const vectorized::PathInData& path);
141
24.0k
    FieldAggregationMethod aggregation() const { return _aggregation; }
142
    vectorized::AggregateFunctionPtr get_aggregate_function_union(
143
            vectorized::DataTypePtr type, int current_be_exec_version) const;
144
    vectorized::AggregateFunctionPtr get_aggregate_function(std::string suffix,
145
                                                            int current_be_exec_version) const;
146
257k
    int precision() const { return _precision; }
147
257k
    int frac() const { return _frac; }
148
2
    inline bool visible() const { return _visible; }
149
    bool has_char_type() const;
150
151
1.15k
    void set_aggregation_method(FieldAggregationMethod agg) {
152
1.15k
        _aggregation = agg;
153
1.15k
        _aggregation_name = get_string_by_aggregation_type(agg);
154
1.15k
    }
155
156
    /**
157
     * Add a sub column.
158
     */
159
    void add_sub_column(TabletColumn& sub_column);
160
161
17.4k
    uint32_t get_subtype_count() const { return _sub_column_count; }
162
2.62k
    MOCK_FUNCTION const TabletColumn& get_sub_column(uint64_t i) const { return *_sub_columns[i]; }
163
2.71k
    const std::vector<TabletColumnPtr>& get_sub_columns() const { return _sub_columns; }
164
165
    friend bool operator==(const TabletColumn& a, const TabletColumn& b);
166
    friend bool operator!=(const TabletColumn& a, const TabletColumn& b);
167
168
    static std::string get_string_by_field_type(FieldType type);
169
    static std::string get_string_by_aggregation_type(FieldAggregationMethod aggregation_type);
170
    static FieldType get_field_type_by_string(const std::string& str);
171
    static FieldType get_field_type_by_type(PrimitiveType type);
172
    static PrimitiveType get_primitive_type_by_field_type(FieldType type);
173
    static FieldAggregationMethod get_aggregation_type_by_string(const std::string& str);
174
    static uint32_t get_field_length_by_type(TPrimitiveType::type type, uint32_t string_length);
175
    bool is_row_store_column() const;
176
13.8k
    std::string get_aggregation_name() const { return _aggregation_name; }
177
13.8k
    bool get_result_is_nullable() const { return _result_is_nullable; }
178
13.8k
    int get_be_exec_version() const { return _be_exec_version; }
179
96.2k
    bool has_path_info() const { return _column_path != nullptr && !_column_path->empty(); }
180
151k
    const vectorized::PathInDataPtr& path_info_ptr() const { return _column_path; }
181
    // If it is an extracted column from variant column
182
175k
    bool is_extracted_column() const {
183
175k
        return _column_path != nullptr && !_column_path->empty() && _parent_col_unique_id > 0;
184
175k
    };
185
36.6k
    std::string suffix_path() const {
186
36.6k
        return is_extracted_column() ? _column_path->get_path() : "";
187
36.6k
    }
188
609
    bool is_nested_subcolumn() const {
189
609
        return _column_path != nullptr && _column_path->has_nested_part();
190
609
    }
191
32.1k
    int32_t parent_unique_id() const { return _parent_col_unique_id; }
192
1.24k
    void set_parent_unique_id(int32_t col_unique_id) { _parent_col_unique_id = col_unique_id; }
193
332
    void set_is_bf_column(bool is_bf_column) { _is_bf_column = is_bf_column; }
194
0
    void set_has_bitmap_index(bool has_bitmap_index) { _has_bitmap_index = has_bitmap_index; }
195
    std::shared_ptr<const vectorized::IDataType> get_vec_type() const;
196
197
505
    Status check_valid() const {
198
505
        if (type() != FieldType::OLAP_FIELD_TYPE_ARRAY &&
199
505
            type() != FieldType::OLAP_FIELD_TYPE_STRUCT &&
200
505
            type() != FieldType::OLAP_FIELD_TYPE_MAP) {
201
505
            return Status::OK();
202
505
        }
203
0
        if (is_bf_column()) {
204
0
            return Status::NotSupported("Do not support bloom filter index, type={}",
205
0
                                        get_string_by_field_type(type()));
206
0
        }
207
0
        if (has_bitmap_index()) {
208
0
            return Status::NotSupported("Do not support bitmap index, type={}",
209
0
                                        get_string_by_field_type(type()));
210
0
        }
211
0
        return Status::OK();
212
0
    }
213
214
2
    void set_precision(int precision) {
215
2
        _precision = precision;
216
2
        _is_decimal = true;
217
2
    }
218
219
53
    void set_frac(int frac) { _frac = frac; }
220
221
67
    void set_variant_max_subcolumns_count(int32_t variant_max_subcolumns_count) {
222
67
        _variant_max_subcolumns_count = variant_max_subcolumns_count;
223
67
    }
224
225
13
    void set_variant_enable_typed_paths_to_sparse(bool enable) {
226
13
        _variant_enable_typed_paths_to_sparse = enable;
227
13
    }
228
229
    void set_variant_max_sparse_column_statistics_size(
230
2
            int32_t variant_max_sparse_column_statistics_size) {
231
2
        _variant_max_sparse_column_statistics_size = variant_max_sparse_column_statistics_size;
232
2
    }
233
234
2.30k
    int32_t variant_max_subcolumns_count() const { return _variant_max_subcolumns_count; }
235
236
154
    PatternTypePB pattern_type() const { return _pattern_type; }
237
238
370
    bool variant_enable_typed_paths_to_sparse() const {
239
370
        return _variant_enable_typed_paths_to_sparse;
240
370
    }
241
242
22.2k
    int32_t variant_max_sparse_column_statistics_size() const {
243
22.2k
        return _variant_max_sparse_column_statistics_size;
244
22.2k
    }
245
246
51
    bool is_decimal() const { return _is_decimal; }
247
248
private:
249
    int32_t _unique_id = -1;
250
    std::string _col_name;
251
    std::string _col_name_lower_case;
252
    // the field _type will change from TPrimitiveType
253
    // to string by 'EnumToString(TPrimitiveType, tcolumn.column_type.type, data_type);' (reference: TabletMeta::init_column_from_tcolumn)
254
    // to FieldType by 'TabletColumn::get_field_type_by_string' (reference: TabletColumn::init_from_pb).
255
    // And the _type in columnPB is string and it changed from FieldType by 'get_string_by_field_type' (reference: TabletColumn::to_schema_pb).
256
    FieldType _type;
257
    bool _is_key = false;
258
    FieldAggregationMethod _aggregation;
259
    std::string _aggregation_name;
260
    bool _is_nullable = false;
261
    bool _is_auto_increment = false;
262
    bool _is_on_update_current_timestamp {false};
263
264
    bool _has_default_value = false;
265
    std::string _default_value;
266
267
    bool _is_decimal = false;
268
    int32_t _precision = -1;
269
    int32_t _frac = -1;
270
271
    int32_t _length = -1;
272
    int32_t _index_length = -1;
273
274
    bool _is_bf_column = false;
275
276
    bool _has_bitmap_index = false;
277
    bool _visible = true;
278
279
    std::vector<TabletColumnPtr> _sub_columns;
280
    uint32_t _sub_column_count = 0;
281
282
    bool _result_is_nullable = false;
283
    int _be_exec_version = -1;
284
285
    // The extracted sub-columns from "variant" contain the following information:
286
    int32_t _parent_col_unique_id = -1;     // "variant" -> col_unique_id
287
    vectorized::PathInDataPtr _column_path; // the path of the sub-columns themselves
288
289
    int32_t _variant_max_subcolumns_count = 0;
290
    PatternTypePB _pattern_type = PatternTypePB::MATCH_NAME_GLOB;
291
    bool _variant_enable_typed_paths_to_sparse = false;
292
    // set variant_max_sparse_column_statistics_size
293
    int32_t _variant_max_sparse_column_statistics_size =
294
            BeConsts::DEFAULT_VARIANT_MAX_SPARSE_COLUMN_STATS_SIZE;
295
};
296
297
bool operator==(const TabletColumn& a, const TabletColumn& b);
298
bool operator!=(const TabletColumn& a, const TabletColumn& b);
299
300
class TabletIndex : public MetadataAdder<TabletIndex> {
301
public:
302
7.54k
    TabletIndex() = default;
303
    void init_from_thrift(const TOlapTableIndex& index, const TabletSchema& tablet_schema);
304
    void init_from_thrift(const TOlapTableIndex& index, const std::vector<int32_t>& column_uids);
305
    void init_from_pb(const TabletIndexPB& index);
306
    void to_schema_pb(TabletIndexPB* index) const;
307
308
19.0k
    int64_t index_id() const { return _index_id; }
309
21
    const std::string& index_name() const { return _index_name; }
310
13.3k
    MOCK_FUNCTION IndexType index_type() const { return _index_type; }
311
9.28k
    const std::vector<int32_t>& col_unique_ids() const { return _col_unique_ids; }
312
25.7k
    MOCK_FUNCTION const std::map<std::string, std::string>& properties() const {
313
25.7k
        return _properties;
314
25.7k
    }
315
1
    int32_t get_gram_size() const {
316
1
        if (_properties.contains("gram_size")) {
317
1
            return std::stoi(_properties.at("gram_size"));
318
1
        }
319
320
0
        return 0;
321
1
    }
322
1
    int32_t get_gram_bf_size() const {
323
1
        if (_properties.contains("bf_size")) {
324
1
            return std::stoi(_properties.at("bf_size"));
325
1
        }
326
327
0
        return 0;
328
1
    }
329
330
15.8k
    const std::string& get_index_suffix() const { return _escaped_index_suffix_path; }
331
332
    void set_escaped_escaped_index_suffix_path(const std::string& name);
333
334
2
    bool is_inverted_index() const { return _index_type == IndexType::INVERTED; }
335
336
8
    void remove_parser_and_analyzer() {
337
8
        _properties.erase(INVERTED_INDEX_PARSER_KEY);
338
8
        _properties.erase(INVERTED_INDEX_CUSTOM_ANALYZER_KEY);
339
8
    }
340
341
7.44k
    std::string field_pattern() const {
342
7.44k
        if (_properties.contains("field_pattern")) {
343
8
            return _properties.at("field_pattern");
344
8
        }
345
7.44k
        return "";
346
7.44k
    }
347
348
8
    bool is_same_except_id(const TabletIndex* other) const {
349
8
        return _escaped_index_suffix_path == other->_escaped_index_suffix_path &&
350
8
               _index_name == other->_index_name && _index_type == other->_index_type &&
351
8
               _col_unique_ids == other->_col_unique_ids && _properties == other->_properties;
352
8
    }
353
354
private:
355
    int64_t _index_id = -1;
356
    // Identify the different index with the same _index_id
357
    std::string _escaped_index_suffix_path;
358
    std::string _index_name;
359
    IndexType _index_type;
360
    std::vector<int32_t> _col_unique_ids;
361
    std::map<std::string, std::string> _properties;
362
};
363
364
using TabletIndexPtr = std::shared_ptr<TabletIndex>;
365
using TabletIndexes = std::vector<std::shared_ptr<TabletIndex>>;
366
using PathSet = phmap::flat_hash_set<std::string>;
367
368
class TabletSchema : public MetadataAdder<TabletSchema> {
369
public:
370
    enum class ColumnType { NORMAL = 0, DROPPED = 1, VARIANT = 2 };
371
    // TODO(yingchun): better to make constructor as private to avoid
372
    // manually init members incorrectly, and define a new function like
373
    // void create_from_pb(const TabletSchemaPB& schema, TabletSchema* tablet_schema).
374
    TabletSchema();
375
    ~TabletSchema() override;
376
377
    // Init from pb
378
    // ignore_extracted_columns: ignore the extracted columns from variant column
379
    // reuse_cached_column: reuse the cached column in the schema if they are the same, to reduce memory usage
380
    void init_from_pb(const TabletSchemaPB& schema, bool ignore_extracted_columns = false,
381
                      bool reuse_cached_column = false);
382
    // Notice: Use deterministic way to serialize protobuf,
383
    // since serialize Map in protobuf may could lead to un-deterministic by default
384
    template <class PbType>
385
4.23k
    static std::string deterministic_string_serialize(const PbType& pb) {
386
4.23k
        std::string output;
387
4.23k
        google::protobuf::io::StringOutputStream string_output_stream(&output);
388
4.23k
        google::protobuf::io::CodedOutputStream output_stream(&string_output_stream);
389
4.23k
        output_stream.SetSerializationDeterministic(true);
390
4.23k
        pb.SerializeToCodedStream(&output_stream);
391
4.23k
        return output;
392
4.23k
    }
_ZN5doris12TabletSchema30deterministic_string_serializeINS_14TabletSchemaPBEEENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERKT_
Line
Count
Source
385
3.76k
    static std::string deterministic_string_serialize(const PbType& pb) {
386
3.76k
        std::string output;
387
3.76k
        google::protobuf::io::StringOutputStream string_output_stream(&output);
388
3.76k
        google::protobuf::io::CodedOutputStream output_stream(&string_output_stream);
389
3.76k
        output_stream.SetSerializationDeterministic(true);
390
3.76k
        pb.SerializeToCodedStream(&output_stream);
391
3.76k
        return output;
392
3.76k
    }
_ZN5doris12TabletSchema30deterministic_string_serializeINS_8ColumnPBEEENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERKT_
Line
Count
Source
385
320
    static std::string deterministic_string_serialize(const PbType& pb) {
386
320
        std::string output;
387
320
        google::protobuf::io::StringOutputStream string_output_stream(&output);
388
320
        google::protobuf::io::CodedOutputStream output_stream(&string_output_stream);
389
320
        output_stream.SetSerializationDeterministic(true);
390
320
        pb.SerializeToCodedStream(&output_stream);
391
320
        return output;
392
320
    }
_ZN5doris12TabletSchema30deterministic_string_serializeINS_13TabletIndexPBEEENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERKT_
Line
Count
Source
385
149
    static std::string deterministic_string_serialize(const PbType& pb) {
386
149
        std::string output;
387
149
        google::protobuf::io::StringOutputStream string_output_stream(&output);
388
149
        google::protobuf::io::CodedOutputStream output_stream(&string_output_stream);
389
149
        output_stream.SetSerializationDeterministic(true);
390
149
        pb.SerializeToCodedStream(&output_stream);
391
149
        return output;
392
149
    }
393
    void to_schema_pb(TabletSchemaPB* tablet_meta_pb) const;
394
    void append_column(TabletColumn column, ColumnType col_type = ColumnType::NORMAL);
395
    void append_index(TabletIndex&& index);
396
    void remove_index(int64_t index_id);
397
    void clear_index();
398
    // Must make sure the row column is always the last column
399
    void add_row_column();
400
    void copy_from(const TabletSchema& tablet_schema);
401
    // lightweight copy, take care of lifecycle of TabletColumn
402
    void shawdow_copy_without_columns(const TabletSchema& tablet_schema);
403
    void update_index_info_from(const TabletSchema& tablet_schema);
404
    std::string to_key() const;
405
    // get_metadata_size is only the memory of the TabletSchema itself, not include child objects.
406
57
    int64_t mem_size() const { return get_metadata_size(); }
407
    size_t row_size() const;
408
    int32_t field_index(const std::string& field_name) const;
409
    int32_t field_index(const vectorized::PathInData& path) const;
410
    int32_t field_index(int32_t col_unique_id) const;
411
    const TabletColumn& column(size_t ordinal) const;
412
    Result<const TabletColumn*> column(const std::string& field_name) const;
413
    Status have_column(const std::string& field_name) const;
414
    bool exist_column(const std::string& field_name) const;
415
    bool has_column_unique_id(int32_t col_unique_id) const;
416
    const TabletColumn& column_by_uid(int32_t col_unique_id) const;
417
    TabletColumn& mutable_column_by_uid(int32_t col_unique_id);
418
    TabletColumn& mutable_column(size_t ordinal);
419
    void replace_column(size_t pos, TabletColumn new_col);
420
    const std::vector<TabletColumnPtr>& columns() const;
421
594k
    size_t num_columns() const { return _num_columns; }
422
1.08M
    size_t num_key_columns() const { return _num_key_columns; }
423
136k
    const std::vector<uint32_t>& cluster_key_uids() const { return _cluster_key_uids; }
424
0
    size_t num_null_columns() const { return _num_null_columns; }
425
5.33k
    size_t num_short_key_columns() const { return _num_short_key_columns; }
426
0
    size_t num_rows_per_row_block() const { return _num_rows_per_row_block; }
427
1.17k
    size_t num_variant_columns() const { return _num_variant_columns; };
428
0
    size_t num_virtual_columns() const { return _num_virtual_columns; }
429
7.11M
    KeysType keys_type() const { return _keys_type; }
430
5.62k
    SortType sort_type() const { return _sort_type; }
431
0
    size_t sort_col_num() const { return _sort_col_num; }
432
0
    CompressKind compress_kind() const { return _compress_kind; }
433
0
    size_t next_column_unique_id() const { return _next_column_unique_id; }
434
4
    bool has_bf_fpp() const { return _has_bf_fpp; }
435
4
    double bloom_filter_fpp() const { return _bf_fpp; }
436
18.7k
    bool is_in_memory() const { return _is_in_memory; }
437
0
    void set_is_in_memory(bool is_in_memory) { _is_in_memory = is_in_memory; }
438
2
    void set_disable_auto_compaction(bool disable_auto_compaction) {
439
2
        _disable_auto_compaction = disable_auto_compaction;
440
2
    }
441
288
    bool disable_auto_compaction() const { return _disable_auto_compaction; }
442
0
    void set_enable_variant_flatten_nested(bool flatten_nested) {
443
0
        _enable_variant_flatten_nested = flatten_nested;
444
0
    }
445
0
    bool variant_flatten_nested() const { return _enable_variant_flatten_nested; }
446
0
    void set_enable_single_replica_compaction(bool enable_single_replica_compaction) {
447
0
        _enable_single_replica_compaction = enable_single_replica_compaction;
448
0
    }
449
351
    bool enable_single_replica_compaction() const { return _enable_single_replica_compaction; }
450
    // indicate if full row store column(all the columns encodes as row) exists
451
0
    bool has_row_store_for_all_columns() const {
452
0
        return _store_row_column && row_columns_uids().empty();
453
0
    }
454
0
    void set_skip_write_index_on_load(bool skip) { _skip_write_index_on_load = skip; }
455
73
    bool skip_write_index_on_load() const { return _skip_write_index_on_load; }
456
8.20k
    int32_t delete_sign_idx() const { return _delete_sign_idx; }
457
0
    void set_delete_sign_idx(int32_t delete_sign_idx) { _delete_sign_idx = delete_sign_idx; }
458
142k
    bool has_sequence_col() const { return _sequence_col_idx != -1; }
459
64.7k
    int32_t sequence_col_idx() const { return _sequence_col_idx; }
460
0
    void set_version_col_idx(int32_t version_col_idx) { _version_col_idx = version_col_idx; }
461
0
    int32_t version_col_idx() const { return _version_col_idx; }
462
0
    bool has_skip_bitmap_col() const { return _skip_bitmap_col_idx != -1; }
463
0
    int32_t skip_bitmap_col_idx() const { return _skip_bitmap_col_idx; }
464
5.21k
    segment_v2::CompressionTypePB compression_type() const { return _compression_type; }
465
0
    void set_row_store_page_size(long page_size) { _row_store_page_size = page_size; }
466
0
    long row_store_page_size() const { return _row_store_page_size; }
467
0
    void set_storage_page_size(long storage_page_size) { _storage_page_size = storage_page_size; }
468
13.8k
    long storage_page_size() const { return _storage_page_size; }
469
0
    void set_storage_dict_page_size(long storage_dict_page_size) {
470
0
        _storage_dict_page_size = storage_dict_page_size;
471
0
    }
472
13.8k
    long storage_dict_page_size() const { return _storage_dict_page_size; }
473
0
    bool has_global_row_id() const {
474
0
        for (auto [col_name, _] : _field_name_to_index) {
475
0
            if (col_name.start_with(StringRef(BeConsts::GLOBAL_ROWID_COL.data(),
476
0
                                              BeConsts::GLOBAL_ROWID_COL.size()))) {
477
0
                return true;
478
0
            }
479
0
        }
480
0
        return false;
481
0
    }
482
483
120
    const std::vector<const TabletIndex*> inverted_indexes() const {
484
120
        std::vector<const TabletIndex*> inverted_indexes;
485
1.25k
        for (const auto& index : _indexes) {
486
1.25k
            if (index->index_type() == IndexType::INVERTED) {
487
1.25k
                inverted_indexes.emplace_back(index.get());
488
1.25k
            }
489
1.25k
        }
490
120
        return inverted_indexes;
491
120
    }
492
11.3k
    bool has_inverted_index() const {
493
11.3k
        for (const auto& index : _indexes) {
494
703
            DBUG_EXECUTE_IF("tablet_schema::has_inverted_index", {
495
703
                if (index->col_unique_ids().empty()) {
496
703
                    throw Exception(Status::InternalError("col unique ids cannot be empty"));
497
703
                }
498
703
            });
499
500
703
            if (index->index_type() == IndexType::INVERTED) {
501
                //if index_id == -1, ignore it.
502
703
                if (!index->col_unique_ids().empty() && index->col_unique_ids()[0] >= 0) {
503
703
                    return true;
504
703
                }
505
703
            }
506
703
        }
507
10.6k
        return false;
508
11.3k
    }
509
510
10.6k
    bool has_ann_index() const {
511
10.6k
        for (const auto& index : _indexes) {
512
0
            if (index->index_type() == IndexType::ANN) {
513
0
                if (!index->col_unique_ids().empty() && index->col_unique_ids()[0] >= 0) {
514
0
                    return true;
515
0
                }
516
0
            }
517
0
        }
518
10.6k
        return false;
519
10.6k
    }
520
521
    bool has_inverted_index_with_index_id(int64_t index_id) const;
522
523
    std::vector<const TabletIndex*> inverted_indexs(const TabletColumn& col) const;
524
525
    std::vector<const TabletIndex*> inverted_indexs(int32_t col_unique_id,
526
                                                    const std::string& suffix_path = "") const;
527
    const TabletIndex* ann_index(const TabletColumn& col) const;
528
529
    // Regardless of whether this column supports inverted index
530
    // TabletIndex information will be returned as long as it exists.
531
    const TabletIndex* ann_index(int32_t col_unique_id, const std::string& suffix_path = "") const;
532
533
    std::vector<TabletIndexPtr> inverted_index_by_field_pattern(
534
            int32_t col_unique_id, const std::string& field_pattern) const;
535
536
    bool has_ngram_bf_index(int32_t col_unique_id) const;
537
    const TabletIndex* get_ngram_bf_index(int32_t col_unique_id) const;
538
    void update_indexes_from_thrift(const std::vector<doris::TOlapTableIndex>& indexes);
539
    // If schema version is not set, it should be -1
540
1.56k
    int32_t schema_version() const { return _schema_version; }
541
    void clear_columns();
542
    vectorized::Block create_block(
543
            const std::vector<uint32_t>& return_columns,
544
            const std::unordered_set<uint32_t>* tablet_columns_need_convert_null = nullptr) const;
545
    vectorized::Block create_block(bool ignore_dropped_col = true) const;
546
2
    void set_schema_version(int32_t version) { _schema_version = version; }
547
0
    void set_auto_increment_column(const std::string& auto_increment_column) {
548
0
        _auto_increment_column = auto_increment_column;
549
0
    }
550
0
    std::string auto_increment_column() const { return _auto_increment_column; }
551
552
28
    void set_table_id(int64_t table_id) { _table_id = table_id; }
553
476
    int64_t table_id() const { return _table_id; }
554
28
    void set_db_id(int64_t db_id) { _db_id = db_id; }
555
0
    int64_t db_id() const { return _db_id; }
556
    void build_current_tablet_schema(int64_t index_id, int32_t version,
557
                                     const OlapTableIndexSchema* index,
558
                                     const TabletSchema& out_tablet_schema);
559
560
    // Merge columns that not exit in current schema, these column is dropped in current schema
561
    // but they are useful in some cases. For example,
562
    // 1. origin schema is  ColA, ColB
563
    // 2. insert values     1, 2
564
    // 3. delete where ColB = 2
565
    // 4. drop ColB
566
    // 5. insert values  3
567
    // 6. add column ColB, although it is name ColB, but it is different with previous ColB, the new ColB we name could call ColB'
568
    // 7. insert value  4, 5
569
    // Then the read schema should be ColA, ColB, ColB' because the delete predicate need ColB to remove related data.
570
    // Because they have same name, so that the dropped column should not be added to the map, only with unique id.
571
    void merge_dropped_columns(const TabletSchema& src_schema);
572
573
    bool is_dropped_column(const TabletColumn& col) const;
574
575
    // copy extracted columns from src_schema
576
    void copy_extracted_columns(const TabletSchema& src_schema);
577
578
    // only reserve extracted columns
579
    void reserve_extracted_columns();
580
581
4.04k
    std::string get_all_field_names() const {
582
4.04k
        std::string str = "[";
583
4.04k
        for (auto p : _field_name_to_index) {
584
4.04k
            if (str.size() > 1) {
585
0
                str += ", ";
586
0
            }
587
4.04k
            str += p.first.to_string() + "(" + std::to_string(_cols[p.second]->unique_id()) + ")";
588
4.04k
        }
589
4.04k
        str += "]";
590
4.04k
        return str;
591
4.04k
    }
592
593
    // Dump [(name, type, is_nullable), ...]
594
1
    std::string dump_structure() const {
595
1
        std::string str = "[";
596
15
        for (auto p : _cols) {
597
15
            if (str.size() > 1) {
598
14
                str += ", ";
599
14
            }
600
15
            str += "(";
601
15
            str += p->name();
602
15
            str += ", ";
603
15
            str += TabletColumn::get_string_by_field_type(p->type());
604
15
            str += ", ";
605
15
            str += "is_nullable:";
606
15
            str += (p->is_nullable() ? "true" : "false");
607
15
            str += ")";
608
15
        }
609
1
        str += "]";
610
1
        return str;
611
1
    }
612
613
1
    std::string dump_full_schema() const {
614
1
        std::string str = "[";
615
4
        for (auto p : _cols) {
616
4
            if (str.size() > 1) {
617
3
                str += ", ";
618
3
            }
619
4
            ColumnPB col_pb;
620
4
            p->to_schema_pb(&col_pb);
621
4
            str += "(";
622
4
            str += col_pb.ShortDebugString();
623
4
            str += ")";
624
4
        }
625
1
        str += "]";
626
1
        return str;
627
1
    }
628
629
    vectorized::Block create_block_by_cids(const std::vector<uint32_t>& cids) const;
630
631
    std::shared_ptr<TabletSchema> copy_without_variant_extracted_columns();
632
9.34k
    InvertedIndexStorageFormatPB get_inverted_index_storage_format() const {
633
9.34k
        return _inverted_index_storage_format;
634
9.34k
    }
635
636
    void update_tablet_columns(const TabletSchema& tablet_schema,
637
                               const std::vector<TColumn>& t_columns);
638
639
0
    const std::vector<int32_t>& row_columns_uids() const { return _row_store_column_unique_ids; }
640
641
    int64_t get_metadata_size() const override;
642
643
    struct SubColumnInfo {
644
        TabletColumn column;
645
        TabletIndexes indexes;
646
    };
647
648
    // all path in path_set_info are relative to the parent column
649
    struct PathsSetInfo {
650
        std::unordered_map<std::string, SubColumnInfo> typed_path_set;    // typed columns
651
        std::unordered_map<std::string, TabletIndexes> subcolumn_indexes; // subcolumns indexes
652
        PathSet sub_path_set;                                             // extracted columns
653
        PathSet sparse_path_set;                                          // sparse columns
654
    };
655
656
41
    void set_path_set_info(std::unordered_map<int32_t, PathsSetInfo>&& path_set_info_map) {
657
41
        _path_set_info_map = std::move(path_set_info_map);
658
41
    }
659
660
2
    const PathsSetInfo& path_set_info(int32_t unique_id) const {
661
2
        return _path_set_info_map.at(unique_id);
662
2
    }
663
664
6
    bool need_record_variant_extended_schema() const { return variant_max_subcolumns_count() == 0; }
665
666
11
    int32_t variant_max_subcolumns_count() const {
667
12
        for (const auto& col : _cols) {
668
12
            if (col->is_variant_type()) {
669
7
                return col->variant_max_subcolumns_count();
670
7
            }
671
12
        }
672
4
        return 0;
673
11
    }
674
675
private:
676
    friend bool operator==(const TabletSchema& a, const TabletSchema& b);
677
    friend bool operator!=(const TabletSchema& a, const TabletSchema& b);
678
0
    TabletSchema(const TabletSchema&) = default;
679
680
    KeysType _keys_type = DUP_KEYS;
681
    SortType _sort_type = SortType::LEXICAL;
682
    size_t _sort_col_num = 0;
683
    std::vector<TabletColumnPtr> _cols;
684
685
    std::vector<TabletIndexPtr> _indexes;
686
    std::unordered_map<StringRef, int32_t, StringRefHash> _field_name_to_index;
687
    std::unordered_map<int32_t, int32_t> _field_uniqueid_to_index;
688
    std::unordered_map<vectorized::PathInDataRef, int32_t, vectorized::PathInDataRef::Hash>
689
            _field_path_to_index;
690
691
    // index_type/col_unique_id/suffix -> idxs in _indexes
692
    using IndexKey = std::tuple<IndexType, int32_t, std::string>;
693
    struct IndexKeyHash {
694
51.8k
        size_t operator()(const IndexKey& t) const {
695
51.8k
            uint32_t seed = 0;
696
51.8k
            seed = doris::HashUtil::hash((const char*)&std::get<0>(t), sizeof(std::get<0>(t)),
697
51.8k
                                         seed);
698
51.8k
            seed = doris::HashUtil::hash((const char*)&std::get<1>(t), sizeof(std::get<1>(t)),
699
51.8k
                                         seed);
700
51.8k
            seed = doris::HashUtil::hash((const char*)std::get<2>(t).c_str(),
701
51.8k
                                         static_cast<uint32_t>(std::get<2>(t).size()), seed);
702
51.8k
            return seed;
703
51.8k
        }
704
    };
705
    std::unordered_map<IndexKey, std::vector<size_t>, IndexKeyHash> _col_id_suffix_to_index;
706
707
    int32_t _num_columns = 0;
708
    size_t _num_variant_columns = 0;
709
    size_t _num_virtual_columns = 0;
710
    size_t _num_key_columns = 0;
711
    std::vector<uint32_t> _cluster_key_uids;
712
    size_t _num_null_columns = 0;
713
    size_t _num_short_key_columns = 0;
714
    size_t _num_rows_per_row_block = 0;
715
    CompressKind _compress_kind = COMPRESS_NONE;
716
    segment_v2::CompressionTypePB _compression_type = segment_v2::CompressionTypePB::LZ4F;
717
    long _row_store_page_size = segment_v2::ROW_STORE_PAGE_SIZE_DEFAULT_VALUE;
718
    long _storage_page_size = segment_v2::STORAGE_PAGE_SIZE_DEFAULT_VALUE;
719
    long _storage_dict_page_size = segment_v2::STORAGE_DICT_PAGE_SIZE_DEFAULT_VALUE;
720
    size_t _next_column_unique_id = 0;
721
    std::string _auto_increment_column;
722
723
    bool _has_bf_fpp = false;
724
    double _bf_fpp = 0;
725
    bool _is_in_memory = false;
726
    int32_t _delete_sign_idx = -1;
727
    int32_t _sequence_col_idx = -1;
728
    int32_t _version_col_idx = -1;
729
    int32_t _skip_bitmap_col_idx = -1;
730
    int32_t _schema_version = -1;
731
    int64_t _table_id = -1;
732
    int64_t _db_id = -1;
733
    bool _disable_auto_compaction = false;
734
    bool _enable_single_replica_compaction = false;
735
    bool _store_row_column = false;
736
    bool _skip_write_index_on_load = false;
737
    InvertedIndexStorageFormatPB _inverted_index_storage_format = InvertedIndexStorageFormatPB::V1;
738
739
    // Contains column ids of which columns should be encoded into row store.
740
    // ATTN: For compability reason empty cids means all columns of tablet schema are encoded to row column
741
    std::vector<int32_t> _row_store_column_unique_ids;
742
    bool _enable_variant_flatten_nested = false;
743
744
    std::map<size_t, int32_t> _vir_col_idx_to_unique_id;
745
746
    // value: extracted path set and sparse path set
747
    std::unordered_map<int32_t, PathsSetInfo> _path_set_info_map;
748
749
    // key: field_pattern
750
    // value: indexes
751
    using PatternToIndex = std::unordered_map<std::string, std::vector<TabletIndexPtr>>;
752
    std::unordered_map<int32_t, PatternToIndex> _index_by_unique_id_with_pattern;
753
};
754
755
bool operator==(const TabletSchema& a, const TabletSchema& b);
756
bool operator!=(const TabletSchema& a, const TabletSchema& b);
757
758
using TabletSchemaSPtr = std::shared_ptr<TabletSchema>;
759
760
#include "common/compile_check_end.h"
761
} // namespace doris