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

#include "planner/operator/logical_plan_util.h"

#include "binder/expression/property_expression.h"
#include "planner/operator/extend/logical_extend.h"
#include "planner/operator/logical_hash_join.h"
#include "planner/operator/logical_intersect.h"
#include "planner/operator/scan/logical_scan_node_table.h"

using namespace lbug::binder;

namespace lbug {
namespace planner {

std::string LogicalPlanUtil::encodeJoin(LogicalPlan& logicalPlan) {
    return encode(logicalPlan.getLastOperator().get());
}

std::string LogicalPlanUtil::encode(LogicalOperator* logicalOperator) {
    std::string result;
    encodeRecursive(logicalOperator, result);
    return result;
}

void LogicalPlanUtil::encodeRecursive(LogicalOperator* logicalOperator, std::string& encodeString) {
    switch (logicalOperator->getOperatorType()) {
    case LogicalOperatorType::CROSS_PRODUCT: {
        encodeCrossProduct(logicalOperator, encodeString);
        for (auto i = 0u; i < logicalOperator->getNumChildren(); ++i) {
            encodeString += "{";
            encodeRecursive(logicalOperator->getChild(i).get(), encodeString);
            encodeString += "}";
        }
    } break;
    case LogicalOperatorType::INTERSECT: {
        encodeIntersect(logicalOperator, encodeString);
        for (auto i = 0u; i < logicalOperator->getNumChildren(); ++i) {
            encodeString += "{";
            encodeRecursive(logicalOperator->getChild(i).get(), encodeString);
            encodeString += "}";
        }
    } break;
    case LogicalOperatorType::HASH_JOIN: {
        encodeHashJoin(logicalOperator, encodeString);
        encodeString += "{";
        encodeRecursive(logicalOperator->getChild(0).get(), encodeString);
        encodeString += "}{";
        encodeRecursive(logicalOperator->getChild(1).get(), encodeString);
        encodeString += "}";
    } break;
    case LogicalOperatorType::EXTEND: {
        encodeExtend(logicalOperator, encodeString);
        encodeRecursive(logicalOperator->getChild(0).get(), encodeString);
    } break;
    case LogicalOperatorType::SCAN_NODE_TABLE: {
        encodeScanNodeTable(logicalOperator, encodeString);
    } break;
    case LogicalOperatorType::FILTER: {
        encodeFilter(logicalOperator, encodeString);
        encodeRecursive(logicalOperator->getChild(0).get(), encodeString);
    } break;
    default:
        for (auto i = 0u; i < logicalOperator->getNumChildren(); ++i) {
            encodeRecursive(logicalOperator->getChild(i).get(), encodeString);
        }
    }
}

void LogicalPlanUtil::encodeCrossProduct(LogicalOperator* /*logicalOperator*/,
    std::string& encodeString) {
    encodeString += "CP()";
}

void LogicalPlanUtil::encodeIntersect(LogicalOperator* logicalOperator, std::string& encodeString) {
    auto& logicalIntersect = logicalOperator->constCast<LogicalIntersect>();
    encodeString += "I(" + logicalIntersect.getIntersectNodeID()->toString() + ")";
}

void LogicalPlanUtil::encodeHashJoin(LogicalOperator* logicalOperator, std::string& encodeString) {
    auto& logicalHashJoin = logicalOperator->constCast<LogicalHashJoin>();
    encodeString += "HJ(" + logicalHashJoin.getExpressionsForPrinting() + ")";
}

void LogicalPlanUtil::encodeExtend(LogicalOperator* logicalOperator, std::string& encodeString) {
    auto& logicalExtend = logicalOperator->constCast<LogicalExtend>();
    encodeString += "E(" + logicalExtend.getNbrNode()->toString() + ")";
}

void LogicalPlanUtil::encodeScanNodeTable(LogicalOperator* logicalOperator,
    std::string& encodeString) {
    auto& scan = logicalOperator->constCast<LogicalScanNodeTable>();
    if (scan.getScanType() == LogicalScanNodeTableType::PRIMARY_KEY_SCAN) {
        encodeString += "IndexScan";
    } else {
        encodeString += "S";
    }
    encodeString +=
        "(" + scan.getNodeID()->constCast<PropertyExpression>().getRawVariableName() + ")";
}

void LogicalPlanUtil::encodeFilter(LogicalOperator*, std::string& encodedString) {
    encodedString += "Filter()";
}

} // namespace planner
} // namespace lbug