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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119

#include "planner/operator/persistent/logical_merge.h"

#include <unordered_set>

#include "binder/expression/node_expression.h"
#include "binder/expression/rel_expression.h"
#include "binder/expression_visitor.h"
#include "common/cast.h"
#include "planner/operator/factorization/flatten_resolver.h"

using namespace lbug::binder;
using namespace lbug::common;

namespace lbug {
namespace planner {

static bool hasNonKeyPayload(const Schema& schema, const expression_vector& keys,
    const std::vector<LogicalInsertInfo>& insertNodeInfos,
    const std::vector<LogicalInsertInfo>& insertRelInfos, const Expression& existenceMark) {
    std::unordered_set<std::string> keyNames;
    keyNames.insert(existenceMark.getUniqueName());
    for (auto& key : keys) {
        keyNames.insert(key->getUniqueName());
        DependentVarNameCollector collector;
        collector.visit(key);
        for (auto& name : collector.getVarNames()) {
            keyNames.insert(name);
        }
    }
    for (auto& info : insertNodeInfos) {
        keyNames.insert(info.pattern->getUniqueName());
        for (auto& expression : info.columnExprs) {
            keyNames.insert(expression->getUniqueName());
        }
    }
    for (auto& info : insertRelInfos) {
        for (auto& expression : info.columnExprs) {
            keyNames.insert(expression->getUniqueName());
        }
    }
    for (auto& expression : schema.getExpressionsInScope()) {
        auto uniqueName = expression->getUniqueName();
        auto isMergePatternExpression = false;
        for (auto& info : insertNodeInfos) {
            isMergePatternExpression |= uniqueName.starts_with(info.pattern->getUniqueName() + ".");
        }
        for (auto& info : insertRelInfos) {
            isMergePatternExpression |= uniqueName.starts_with(info.pattern->getUniqueName() + ".");
        }
        if (!keyNames.contains(uniqueName) && !isMergePatternExpression) {
            return true;
        }
    }
    return false;
}

void LogicalMerge::computeSuppressDuplicateCreatedOutput() {
    auto childSchema = children[0]->getSchema();
    auto storesInsertedPatternIDs = onMatchSetNodeInfos.empty() && onMatchSetRelInfos.empty();
    suppressDuplicateCreatedOutput =
        storesInsertedPatternIDs && insertRelInfos.empty() && onCreateSetNodeInfos.empty() &&
        onCreateSetRelInfos.empty() &&
        !hasNonKeyPayload(*childSchema, keys, insertNodeInfos, insertRelInfos, *existenceMark);
}

void LogicalMerge::computeFactorizedSchema() {
    computeSuppressDuplicateCreatedOutput();
    copyChildSchema(0);
    for (auto& info : insertNodeInfos) {
        // Predicate iri is not matched but needs to be inserted.
        auto node = dynamic_cast_checked<NodeExpression*>(info.pattern.get());
        if (!schema->isExpressionInScope(*node->getInternalID())) {
            auto groupPos = schema->createGroup();
            schema->setGroupAsSingleState(groupPos);
            schema->insertToGroupAndScope(node->getInternalID(), groupPos);
        }
    }
    for (auto& info : insertRelInfos) {
        auto rel = dynamic_cast_checked<RelExpression*>(info.pattern.get());
        if (!schema->isExpressionInScope(*rel->getInternalID())) {
            auto groupPos = schema->createGroup();
            schema->setGroupAsSingleState(groupPos);
            schema->insertToGroupAndScope(rel->getInternalID(), groupPos);
        }
    }
}

void LogicalMerge::computeFlatSchema() {
    computeSuppressDuplicateCreatedOutput();
    copyChildSchema(0);
    for (auto& info : insertNodeInfos) {
        auto node = dynamic_cast_checked<NodeExpression*>(info.pattern.get());
        schema->insertToGroupAndScopeMayRepeat(node->getInternalID(), 0);
    }
    for (auto& info : insertRelInfos) {
        auto rel = dynamic_cast_checked<RelExpression*>(info.pattern.get());
        schema->insertToGroupAndScopeMayRepeat(rel->getInternalID(), 0);
    }
}

f_group_pos_set LogicalMerge::getGroupsPosToFlatten() {
    auto childSchema = children[0]->getSchema();
    return FlattenAll::getGroupsPosToFlatten(childSchema->getGroupsPosInScope(), *childSchema);
}

std::unique_ptr<LogicalOperator> LogicalMerge::copy() {
    auto merge = std::make_unique<LogicalMerge>(existenceMark, keys, children[0]->copy());
    merge->insertNodeInfos = copyVector(insertNodeInfos);
    merge->insertRelInfos = copyVector(insertRelInfos);
    merge->onCreateSetNodeInfos = copyVector(onCreateSetNodeInfos);
    merge->onCreateSetRelInfos = copyVector(onCreateSetRelInfos);
    merge->onMatchSetNodeInfos = copyVector(onMatchSetNodeInfos);
    merge->onMatchSetRelInfos = copyVector(onMatchSetRelInfos);
    merge->suppressDuplicateCreatedOutput = suppressDuplicateCreatedOutput;
    return merge;
}

} // namespace planner
} // namespace lbug