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

#include "planner/join_order/join_tree.h"

namespace lbug {
namespace planner {

std::string TreeNodeTypeUtils::toString(TreeNodeType type) {
    switch (type) {
    case TreeNodeType::NODE_SCAN:
        return "NODE_SCAN";
    case TreeNodeType::REL_SCAN:
        return "REL_SCAN";
    case TreeNodeType::BINARY_JOIN:
        return "BINARY_JOIN";
    case TreeNodeType::MULTIWAY_JOIN:
        return "MULTIWAY_JOIN";
    default:
        UNREACHABLE_CODE;
    }
}

void ExtraScanTreeNodeInfo::merge(const ExtraScanTreeNodeInfo& other) {
    DASSERT(other.nodeInfo == nullptr && other.relInfos.size() == 1);
    relInfos.push_back(other.relInfos[0]);
}

std::string JoinTreeNode::toString() const {
    switch (type) {
    case TreeNodeType::NODE_SCAN:
    case TreeNodeType::REL_SCAN: {
        auto& scanInfo = extraInfo->constCast<ExtraScanTreeNodeInfo>();
        auto result = "Scan(" + scanInfo.nodeInfo->nodeOrRel->toString();
        for (auto relInfo : scanInfo.relInfos) {
            result += "," + relInfo.nodeOrRel->toString();
        }
        result += ")";
        return result;
    }
    case TreeNodeType::BINARY_JOIN: {
        DASSERT(children.size() == 2);
        return "JOIN(" + children[0]->toString() + "," + children[1]->toString() + ")";
    }
    case TreeNodeType::MULTIWAY_JOIN: {
        DASSERT(!children.empty());
        auto result = "MULTI_JOIN(" + children[0]->toString();
        for (auto i = 1u; i < children.size(); ++i) {
            result += "," + children[i]->toString();
        }
        return result;
    }
    default: {
        UNREACHABLE_CODE;
    }
    }
}

} // namespace planner
} // namespace lbug