lbug 0.16.0

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
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

#pragma once

#include "storage/table/column_chunk.h"
#include "storage/table/column_chunk_scanner.h"
namespace lbug {
namespace storage {
struct LazySegmentData {
    LazySegmentData(std::unique_ptr<ColumnChunkData> segmentData,
        common::offset_t startOffsetInSegment, common::offset_t length,
        ColumnChunkScanner::scan_func_t scanFunc)
        : segmentData{std::move(segmentData)}, startOffsetInSegment{startOffsetInSegment},
          length{length}, scanFunc{std::move(scanFunc)} {}

    std::unique_ptr<ColumnChunkData> segmentData;
    common::offset_t startOffsetInSegment;
    common::offset_t length;
    ColumnChunkScanner::scan_func_t scanFunc;

    // Used for genericRangeSegments()
    const LazySegmentData& operator*() const { return *this; }
    common::offset_t getNumValues() const { return length; }
};

// Separately scans each segment in a column chunk
// Avoids scanning a segment unless a call to updateScannedValue() is made for the current segment
class LazySegmentScanner : public ColumnChunkScanner {
public:
    LazySegmentScanner(MemoryManager& mm, common::LogicalType columnType, bool enableCompression)
        : numValues(0), mm(mm), columnType(std::move(columnType)),
          enableCompression(enableCompression) {}

    struct Iterator {
        common::offset_t segmentIdx;
        common::offset_t offsetInSegment;
        LazySegmentScanner& segmentScanner;

        void advance(common::offset_t n);
        void operator++() { advance(1); }
        LazySegmentData& operator*() const;
        LazySegmentData* operator->() const { return &*(*this); }
    };

    Iterator begin() { return Iterator{0, 0, *this}; }

    // Since we lazily scan segments
    // This actually only adds the information needed to scan the segment
    // Either updateScannedValue() or scanSegmentIfNeeded must be called to actually scan
    void scanSegment(common::offset_t offsetInSegment, common::offset_t segmentLength,
        scan_func_t newScanFunc) override;

    void applyCommittedUpdates(const UpdateInfo& updateInfo,
        const transaction::Transaction* transaction, common::offset_t startRow,
        common::offset_t numRows) override;

    uint64_t getNumValues() override { return numValues; }

    void scanSegmentIfNeeded(LazySegmentData& segment);
    void scanSegmentIfNeeded(common::idx_t segmentIdx) {
        scanSegmentIfNeeded(segments[segmentIdx]);
    }

    template<std::invocable<LazySegmentData&, common::offset_t /*offsetInSegment*/,
        common::offset_t /*lengthInSegment*/, common::offset_t /*dstOffset*/>
            Func>
    void rangeSegments(Iterator startIt, common::length_t length, Func func);

private:
    std::vector<LazySegmentData> segments;

    uint64_t numValues;

    MemoryManager& mm;
    common::LogicalType columnType;
    bool enableCompression;
};

inline LazySegmentData& LazySegmentScanner::Iterator::operator*() const {
    DASSERT(segmentIdx < segmentScanner.segments.size() &&
            offsetInSegment < segmentScanner.segments[segmentIdx].length);
    return segmentScanner.segments[segmentIdx];
}

template<
    std::invocable<LazySegmentData&, common::offset_t, common::offset_t, common::offset_t> Func>
void LazySegmentScanner::rangeSegments(Iterator startIt, common::length_t length, Func func) {
    auto segmentSpan = std::span(segments);
    genericRangeSegmentsFromIt(segmentSpan, segmentSpan.begin() + startIt.segmentIdx,
        startIt.offsetInSegment, length, func);
}

} // namespace storage
} // namespace lbug