lbug 0.16.1

An in-process property graph database management system built for query speed and scalability
Documentation 
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

#include "storage/table/column_chunk_stats.h"

#include "common/type_utils.h"
#include "common/types/types.h"
#include "common/vector/value_vector.h"
#include "storage/table/column_chunk_data.h"

namespace lbug {
namespace storage {

void ColumnChunkStats::update(const ColumnChunkData& data, uint64_t offset, uint64_t numValues,
    common::PhysicalTypeID physicalType) {
    const bool isStorageValueType =
        common::TypeUtils::visit(physicalType, []<typename T>(T) { return StorageValueType<T>; });
    if (isStorageValueType || physicalType == common::PhysicalTypeID::INTERNAL_ID) {
        auto [minVal, maxVal] = getMinMaxStorageValue(data, offset, numValues, physicalType);
        update(minVal, maxVal, physicalType);
    }
}

void ColumnChunkStats::update(const common::ValueVector& data, uint64_t offset, uint64_t numValues,
    common::PhysicalTypeID physicalType) {
    const bool isStorageValueType =
        common::TypeUtils::visit(physicalType, []<typename T>(T) { return StorageValueType<T>; });
    if (isStorageValueType || physicalType == common::PhysicalTypeID::INTERNAL_ID) {
        auto [minVal, maxVal] = getMinMaxStorageValue(data, offset, numValues, physicalType);
        update(minVal, maxVal, physicalType);
    }
}

void ColumnChunkStats::update(std::optional<StorageValue> newMin,
    std::optional<StorageValue> newMax, common::PhysicalTypeID dataType) {
    if (!min.has_value() || (newMin.has_value() && min->gt(*newMin, dataType))) {
        min = newMin;
    }
    if (!max.has_value() || (newMax.has_value() && newMax->gt(*max, dataType))) {
        max = newMax;
    }
}

void ColumnChunkStats::update(StorageValue val, common::PhysicalTypeID dataType) {
    if (!min.has_value() || min->gt(val, dataType)) {
        min = val;
    }
    if (!max.has_value() || val.gt(*max, dataType)) {
        max = val;
    }
}

void ColumnChunkStats::reset() {
    *this = {};
}

void MergedColumnChunkStats::merge(const MergedColumnChunkStats& o,
    common::PhysicalTypeID dataType) {
    stats.update(o.stats.min, o.stats.max, dataType);
    guaranteedNoNulls = guaranteedNoNulls && o.guaranteedNoNulls;
    guaranteedAllNulls = guaranteedAllNulls && o.guaranteedAllNulls;
}

} // namespace storage
} // namespace lbug