lbug 0.22.0

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

#pragma once

#include <cstring>

#include "processor/operator/aggregate/aggregate_hash_table.h"

namespace lbug {
namespace processor {

struct PatternCreationInfo {
    uint8_t* tuple;
    bool hasCreated;

    common::nodeID_t getPatternID(common::executor_id_t matchExecutorID) const {
        auto ftColIndex = matchExecutorID;
        // The tuple may start at a misaligned offset inside a packed factorized-table
        // tuple; use memcpy instead of dereferencing a possibly-misaligned pointer.
        common::nodeID_t result;
        memcpy(&result, tuple + ftColIndex * sizeof(common::nodeID_t), sizeof(common::nodeID_t));
        return result;
    }

    void updateID(common::executor_id_t executorID, common::executor_info executorInfo,
        bool storeInsertedPatternIDs, common::nodeID_t nodeID) const;
};

class PatternCreationInfoTable : public AggregateHashTable {
public:
    PatternCreationInfoTable(storage::MemoryManager& memoryManager,
        std::vector<common::LogicalType> keyTypes, FactorizedTableSchema tableSchema);

    PatternCreationInfo getPatternCreationInfo(const std::vector<common::ValueVector*>& keyVectors);

    uint64_t matchFTEntries(std::span<const common::ValueVector*> keyVectors,
        uint64_t numMayMatches, uint64_t numNoMatches) override;

private:
    uint8_t* tuple;
    ft_col_offset_t idColOffset;
};

} // namespace processor
} // namespace lbug