lbug 0.17.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
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

#pragma once

#include "binder/expression/expression.h"
#include "expression_evaluator/expression_evaluator.h"
#include "processor/operator/persistent/batch_insert_error_handler.h"
#include "processor/operator/physical_operator.h"

namespace lbug {
namespace main {
class ClientContext;
} // namespace main
namespace common {
class ValueVector;
} // namespace common
namespace transaction {
class Transaction;
}
namespace storage {
class NodeTable;
} // namespace storage
namespace processor {

struct BatchInsertSharedState;
struct NoIndexLookupCache {
    virtual ~NoIndexLookupCache() = default;
    virtual void buildIfNeeded(storage::NodeTable* nodeTable, transaction::Transaction* transaction,
        main::ClientContext* context) = 0;
    virtual bool lookup(common::ValueVector* keyVector, common::sel_t pos,
        common::offset_t& result) const = 0;
};

struct IndexLookupInfo {
    storage::NodeTable* nodeTable;
    std::unique_ptr<evaluator::ExpressionEvaluator> keyEvaluator;
    DataPos resultVectorPos;
    std::shared_ptr<NoIndexLookupCache> noIndexLookupCache;

    IndexLookupInfo(storage::NodeTable* nodeTable,
        std::unique_ptr<evaluator::ExpressionEvaluator> keyEvaluator,
        const DataPos& resultVectorPos)
        : nodeTable{nodeTable}, keyEvaluator{std::move(keyEvaluator)},
          resultVectorPos{resultVectorPos}, noIndexLookupCache{nullptr} {}
    EXPLICIT_COPY_DEFAULT_MOVE(IndexLookupInfo);

private:
    IndexLookupInfo(const IndexLookupInfo& other)
        : nodeTable{other.nodeTable}, keyEvaluator{other.keyEvaluator->copy()},
          resultVectorPos{other.resultVectorPos}, noIndexLookupCache{other.noIndexLookupCache} {}
};

struct IndexLookupPrintInfo final : OPPrintInfo {
    binder::expression_vector expressions;
    explicit IndexLookupPrintInfo(binder::expression_vector expressions)
        : expressions{std::move(expressions)} {}

    std::string toString() const override;

    std::unique_ptr<OPPrintInfo> copy() const override {
        return std::unique_ptr<IndexLookupPrintInfo>(new IndexLookupPrintInfo(*this));
    }

private:
    IndexLookupPrintInfo(const IndexLookupPrintInfo& other)
        : OPPrintInfo{other}, expressions{other.expressions} {}
};

struct IndexLookupLocalState {
    explicit IndexLookupLocalState(std::unique_ptr<BatchInsertErrorHandler> errorHandler)
        : errorHandler(std::move(errorHandler)) {}

    std::unique_ptr<BatchInsertErrorHandler> errorHandler;
    std::vector<common::ValueVector*> warningDataVectors;
};

class IndexLookup final : public PhysicalOperator {
    static constexpr PhysicalOperatorType type_ = PhysicalOperatorType::INDEX_LOOKUP;

public:
    IndexLookup(std::vector<IndexLookupInfo> infos, std::vector<DataPos> warningDataVectorPos,
        std::unique_ptr<PhysicalOperator> child, common::idx_t id,
        std::unique_ptr<OPPrintInfo> printInfo);

    void initLocalStateInternal(ResultSet* resultSet, ExecutionContext* context) override;

    bool getNextTuplesInternal(ExecutionContext* context) final;

    std::unique_ptr<PhysicalOperator> copy() final {
        return std::make_unique<IndexLookup>(copyVector(infos), warningDataVectorPos,
            children[0]->copy(), getOperatorID(), printInfo->copy());
    }

private:
    void lookup(transaction::Transaction* transaction, const IndexLookupInfo& info);

private:
    std::vector<IndexLookupInfo> infos;
    std::vector<DataPos> warningDataVectorPos;
    std::unique_ptr<IndexLookupLocalState> localState;
};

} // namespace processor
} // namespace lbug