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

#include "storage/table/struct_column.h"

#include "common/types/types.h"
#include "common/vector/value_vector.h"
#include "storage/buffer_manager/memory_manager.h"
#include "storage/storage_utils.h"
#include "storage/table/column_chunk.h"
#include "storage/table/null_column.h"
#include "storage/table/struct_chunk_data.h"

using namespace lbug::catalog;
using namespace lbug::common;
using namespace lbug::transaction;

namespace lbug {
namespace storage {

StructColumn::StructColumn(std::string name, LogicalType dataType, FileHandle* dataFH,
    MemoryManager* mm, ShadowFile* shadowFile, bool enableCompression)
    : Column{std::move(name), std::move(dataType), dataFH, mm, shadowFile, enableCompression,
          true /* requireNullColumn */} {
    const auto fieldTypes = StructType::getFieldTypes(this->dataType);
    childColumns.resize(fieldTypes.size());
    for (auto i = 0u; i < fieldTypes.size(); i++) {
        const auto childColName = StorageUtils::getColumnName(this->name,
            StorageUtils::ColumnType::STRUCT_CHILD, std::to_string(i));
        childColumns[i] = ColumnFactory::createColumn(childColName, fieldTypes[i]->copy(), dataFH,
            mm, shadowFile, enableCompression);
    }
}

std::unique_ptr<ColumnChunkData> StructColumn::flushChunkData(const ColumnChunkData& chunk,
    PageAllocator& pageAllocator) {
    auto flushedChunk = flushNonNestedChunkData(chunk, pageAllocator);
    auto& structChunk = chunk.cast<StructChunkData>();
    auto& flushedStructChunk = flushedChunk->cast<StructChunkData>();
    for (auto i = 0u; i < structChunk.getNumChildren(); i++) {
        auto flushedChildChunk = Column::flushChunkData(structChunk.getChild(i), pageAllocator);
        flushedStructChunk.setChild(i, std::move(flushedChildChunk));
    }
    return flushedChunk;
}

void StructColumn::scanSegment(const SegmentState& state, ColumnChunkData* resultChunk,
    common::offset_t startOffsetInSegment, common::row_idx_t numValuesToScan) const {
    DASSERT(resultChunk->getDataType().getPhysicalType() == PhysicalTypeID::STRUCT);
    // Fix size since Column::scanSegment will adjust the size of the child chunks to be equal to
    // the size of the main one (see note in list_column.cpp)
    // TODO(bmwinger): eventually this shouldn't be necessary
    auto sizeBeforeScan = resultChunk->getNumValues();
    Column::scanSegment(state, resultChunk, startOffsetInSegment, numValuesToScan);
    auto& structColumnChunk = resultChunk->cast<StructChunkData>();
    for (auto i = 0u; i < childColumns.size(); i++) {
        structColumnChunk.getChild(i)->setNumValues(sizeBeforeScan);
        childColumns[i]->scanSegment(state.childrenStates[i], structColumnChunk.getChild(i),
            startOffsetInSegment, numValuesToScan);
    }
}

void StructColumn::scanSegment(const SegmentState& state, offset_t startOffsetInSegment,
    row_idx_t numValuesToScan, ValueVector* resultVector, offset_t offsetInResult) const {
    Column::scanSegment(state, startOffsetInSegment, numValuesToScan, resultVector, offsetInResult);
    for (auto i = 0u; i < childColumns.size(); i++) {
        const auto fieldVector = StructVector::getFieldVector(resultVector, i).get();
        childColumns[i]->scanSegment(state.childrenStates[i], startOffsetInSegment, numValuesToScan,
            fieldVector, offsetInResult);
    }
}

void StructColumn::lookupInternal(const SegmentState& state, offset_t offsetInSegment,
    ValueVector* resultVector, uint32_t posInVector) const {
    for (auto i = 0u; i < childColumns.size(); i++) {
        const auto fieldVector = StructVector::getFieldVector(resultVector, i).get();
        childColumns[i]->lookupInternal(state.childrenStates[i], offsetInSegment, fieldVector,
            posInVector);
    }
}

void StructColumn::writeSegment(ColumnChunkData& persistentChunk, SegmentState& state,
    offset_t offsetInSegment, const ColumnChunkData& data, offset_t dataOffset,
    length_t numValues) const {
    DASSERT(data.getDataType().getPhysicalType() == PhysicalTypeID::STRUCT);
    nullColumn->writeSegment(*persistentChunk.getNullData(), *state.nullState, offsetInSegment,
        *data.getNullData(), dataOffset, numValues);
    auto& structData = data.cast<StructChunkData>();
    auto& persistentStructChunk = persistentChunk.cast<StructChunkData>();
    for (auto i = 0u; i < childColumns.size(); i++) {
        const auto& childData = structData.getChild(i);
        childColumns[i]->writeSegment(*persistentStructChunk.getChild(i), state.childrenStates[i],
            offsetInSegment, childData, dataOffset, numValues);
    }
}

std::vector<std::unique_ptr<ColumnChunkData>> StructColumn::checkpointSegment(
    ColumnCheckpointState&& checkpointState, PageAllocator& pageAllocator,
    bool canSplitSegment) const {
    auto& persistentStructChunk = checkpointState.persistentData.cast<StructChunkData>();
    // TODO(bmwinger): child columns are now handled as a group so they get split together
    // Re-introduce the code below when struct columns checkpoing each field individually again
    /*
    for (auto i = 0u; i < childColumns.size(); i++) {
        std::vector<SegmentCheckpointState> childSegmentCheckpointStates;
        for (const auto& segmentCheckpointState : checkpointState.segmentCheckpointStates) {
            childSegmentCheckpointStates.emplace_back(
                segmentCheckpointState.chunkData.cast<StructChunkData>().getChild(i),
                segmentCheckpointState.startRowInData, segmentCheckpointState.offsetInSegment,
                segmentCheckpointState.numRows);
        }
        childColumns[i]->checkpointSegment(ColumnCheckpointState(*persistentStructChunk.getChild(i),
            std::move(childSegmentCheckpointStates)), pageAllocator);
    }
    Column::checkpointNullData(checkpointState, pageAllocator);
    */
    auto result =
        Column::checkpointSegment(std::move(checkpointState), pageAllocator, canSplitSegment);
    persistentStructChunk.syncNumValues();
    return result;
}

bool StructColumn::canCheckpointInPlace(const SegmentState& state,
    const ColumnCheckpointState& checkpointState) const {
    if (!Column::canCheckpointInPlace(state, checkpointState)) {
        return false;
    }
    for (size_t i = 0; i < childColumns.size(); ++i) {
        auto& structChunkData = checkpointState.persistentData.cast<StructChunkData>();
        DASSERT(childColumns.size() == structChunkData.getNumChildren());
        auto* childChunkData = structChunkData.getChild(i);

        std::vector<SegmentCheckpointState> childSegmentCheckpointStates;
        for (auto& segmentCheckpointState : checkpointState.segmentCheckpointStates) {
            auto& structSegmentData = segmentCheckpointState.chunkData.cast<StructChunkData>();
            auto& childSegmentData = structSegmentData.getChild(i);
            childSegmentCheckpointStates.emplace_back(childSegmentData,
                segmentCheckpointState.offsetInSegment, segmentCheckpointState.startRowInData,
                segmentCheckpointState.numRows);
        }

        if (!childColumns[i]->canCheckpointInPlace(state.getChildState(i),
                ColumnCheckpointState(*childChunkData, std::move(childSegmentCheckpointStates)))) {
            return false;
        }
    }
    return true;
}

} // namespace storage
} // namespace lbug