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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214

#include "binder/binder.h"
#include "binder/expression/property_expression.h"
#include "binder/expression_binder.h"
#include "common/enums/extend_direction_util.h"
#include "main/client_context.h"
#include "planner/operator/extend/logical_extend.h"
#include "planner/operator/scan/logical_scan_node_table.h"
#include "processor/operator/scan/scan_multi_rel_tables.h"
#include "processor/operator/scan/scan_rel_table.h"
#include "processor/plan_mapper.h"
#include "storage/storage_manager.h"
#include "storage/table/node_table.h"

using namespace lbug::binder;
using namespace lbug::common;
using namespace lbug::planner;
using namespace lbug::storage;
using namespace lbug::catalog;

namespace lbug {
namespace processor {

static ScanRelTableInfo getRelTableScanInfo(const TableCatalogEntry& tableEntry,
    RelDataDirection direction, RelTable* relTable, bool shouldScanNbrID,
    const expression_vector& properties, const std::vector<ColumnPredicateSet>& columnPredicates,
    main::ClientContext* clientContext) {
    std::vector<ColumnPredicateSet> columnPredicateSets = copyVector(columnPredicates);
    if (!columnPredicateSets.empty()) {
        // Since we insert a nbr column. We need to pad an empty nbr column predicate set.
        columnPredicateSets.insert(columnPredicateSets.begin(), ColumnPredicateSet());
    }
    auto tableInfo = ScanRelTableInfo(relTable, std::move(columnPredicateSets), direction);
    // We always should scan nbrID from relTable. This is not a property in the schema label, so
    // cannot be bound to a column in the front-end.
    auto nbrColumnID = shouldScanNbrID ? NBR_ID_COLUMN_ID : INVALID_COLUMN_ID;
    tableInfo.addColumnInfo(nbrColumnID, ColumnCaster(LogicalType::INTERNAL_ID()));
    auto binder = Binder(clientContext);
    auto expressionBinder = ExpressionBinder(&binder, clientContext);
    for (auto& expr : properties) {
        auto& property = expr->constCast<PropertyExpression>();
        if (property.hasProperty(tableEntry.getTableID())) {
            auto propertyName = property.getPropertyName();
            auto& columnType = tableEntry.getProperty(propertyName).getType();
            auto columnCaster = ColumnCaster(columnType.copy());
            if (property.getDataType() != columnType) {
                auto columnExpr = std::make_shared<PropertyExpression>(property);
                columnExpr->dataType = columnType.copy();
                columnCaster.setCastExpr(
                    expressionBinder.forceCast(columnExpr, property.getDataType()));
            }
            tableInfo.addColumnInfo(tableEntry.getColumnID(propertyName), std::move(columnCaster));
        } else {
            tableInfo.addColumnInfo(INVALID_COLUMN_ID, ColumnCaster(LogicalType::ANY()));
        }
    }
    return tableInfo;
}

static bool isRelTableQualifies(ExtendDirection direction, table_id_t srcTableID,
    table_id_t dstTableID, table_id_t boundNodeTableID, const table_id_set_t& nbrTableISet) {
    switch (direction) {
    case ExtendDirection::FWD: {
        return srcTableID == boundNodeTableID && nbrTableISet.contains(dstTableID);
    }
    case ExtendDirection::BWD: {
        return dstTableID == boundNodeTableID && nbrTableISet.contains(srcTableID);
    }
    default:
        UNREACHABLE_CODE;
    }
}

static std::vector<ScanRelTableInfo> populateRelTableCollectionScanner(table_id_t boundNodeTableID,
    const table_id_set_t& nbrTableISet, const RelGroupCatalogEntry& entry,
    ExtendDirection extendDirection, bool shouldScanNbrID, const expression_vector& properties,
    const std::vector<ColumnPredicateSet>& columnPredicates, main::ClientContext* clientContext) {
    std::vector<ScanRelTableInfo> scanInfos;
    const auto storageManager = StorageManager::Get(*clientContext);
    for (auto& info : entry.getRelEntryInfos()) {
        auto srcTableID = info.nodePair.srcTableID;
        auto dstTableID = info.nodePair.dstTableID;
        auto relTable = storageManager->getTable(info.oid)->ptrCast<RelTable>();
        switch (extendDirection) {
        case ExtendDirection::FWD: {
            if (isRelTableQualifies(ExtendDirection::FWD, srcTableID, dstTableID, boundNodeTableID,
                    nbrTableISet)) {
                scanInfos.push_back(getRelTableScanInfo(entry, RelDataDirection::FWD, relTable,
                    shouldScanNbrID, properties, columnPredicates, clientContext));
            }
        } break;
        case ExtendDirection::BWD: {
            if (isRelTableQualifies(ExtendDirection::BWD, srcTableID, dstTableID, boundNodeTableID,
                    nbrTableISet)) {
                scanInfos.push_back(getRelTableScanInfo(entry, RelDataDirection::BWD, relTable,
                    shouldScanNbrID, properties, columnPredicates, clientContext));
            }
        } break;
        case ExtendDirection::BOTH: {
            if (isRelTableQualifies(ExtendDirection::FWD, srcTableID, dstTableID, boundNodeTableID,
                    nbrTableISet)) {
                scanInfos.push_back(getRelTableScanInfo(entry, RelDataDirection::FWD, relTable,
                    shouldScanNbrID, properties, columnPredicates, clientContext));
            }
            if (isRelTableQualifies(ExtendDirection::BWD, srcTableID, dstTableID, boundNodeTableID,
                    nbrTableISet)) {
                scanInfos.push_back(getRelTableScanInfo(entry, RelDataDirection::BWD, relTable,
                    shouldScanNbrID, properties, columnPredicates, clientContext));
            }
        } break;
        default:
            UNREACHABLE_CODE;
        }
    }
    return scanInfos;
}

static bool scanSingleRelTable(const RelExpression& rel, const NodeExpression& boundNode,
    ExtendDirection extendDirection) {
    return !rel.isMultiLabeled() && !boundNode.isMultiLabeled() &&
           extendDirection != ExtendDirection::BOTH;
}

std::unique_ptr<PhysicalOperator> PlanMapper::mapExtend(const LogicalOperator* logicalOperator) {
    auto extend = logicalOperator->constPtrCast<LogicalExtend>();
    auto outFSchema = extend->getSchema();
    auto inFSchema = extend->getChild(0)->getSchema();
    auto boundNode = extend->getBoundNode();
    auto nbrNode = extend->getNbrNode();
    auto rel = extend->getRel();
    auto extendDirection = extend->getDirection();
    auto prevOperator = mapOperator(logicalOperator->getChild(0).get());
    auto inNodeIDPos = getDataPos(*boundNode->getInternalID(), *inFSchema);
    std::vector<DataPos> outVectorsPos;
    auto outNodeIDPos = getDataPos(*nbrNode->getInternalID(), *outFSchema);
    outVectorsPos.push_back(outNodeIDPos);
    for (auto& expression : extend->getProperties()) {
        outVectorsPos.push_back(getDataPos(*expression, *outFSchema));
    }
    auto scanInfo = ScanOpInfo(inNodeIDPos, outVectorsPos);
    std::vector<std::string> tableNames;
    auto storageManager = StorageManager::Get(*clientContext);
    for (auto entry : rel->getEntries()) {
        tableNames.push_back(entry->getName());
    }
    auto printInfo = std::make_unique<ScanRelTablePrintInfo>(tableNames, extend->getProperties(),
        boundNode, rel, nbrNode, extendDirection, rel->getVariableName());
    if (scanSingleRelTable(*rel, *boundNode, extendDirection)) {
        DASSERT(rel->getNumEntries() == 1);
        auto entry = rel->getEntry(0)->ptrCast<RelGroupCatalogEntry>();
        auto relDataDirection = ExtendDirectionUtil::getRelDataDirection(extendDirection);
        auto entryInfo = entry->getSingleRelEntryInfo();
        auto relTable = storageManager->getTable(entryInfo.oid)->ptrCast<RelTable>();
        auto scanRelInfo =
            getRelTableScanInfo(*entry, relDataDirection, relTable, extend->shouldScanNbrID(),
                extend->getProperties(), extend->getPropertyPredicates(), clientContext);
        if (logicalOperator->getChild(0)->getOperatorType() ==
            LogicalOperatorType::SCAN_NODE_TABLE) {
            auto* scanNode = logicalOperator->getChild(0)->ptrCast<LogicalScanNodeTable>();
            if (scanNode->getScanType() == LogicalScanNodeTableType::SCAN &&
                scanNode->getProperties().empty()) {
                std::vector<NodeTable*> sourceNodeTables;
                auto expectedBoundTableID = relDataDirection == RelDataDirection::FWD ?
                                                relTable->getFromNodeTableID() :
                                                relTable->getToNodeTableID();
                for (auto tableID : scanNode->getTableIDs()) {
                    if (tableID == expectedBoundTableID) {
                        sourceNodeTables.push_back(
                            storageManager->getTable(tableID)->ptrCast<NodeTable>());
                    }
                }
                // Only apply optimization if scan node is not already mapped (e.g., by a
                // semi-masker)
                if (!sourceNodeTables.empty() &&
                    !logicalOpToPhysicalOpMap.contains(logicalOperator->getChild(0).get())) {
                    return std::make_unique<ScanRelTable>(std::move(scanInfo),
                        std::move(scanRelInfo), std::move(sourceNodeTables), getOperatorID(),
                        printInfo->copy());
                }
            }
        }
        return std::make_unique<ScanRelTable>(std::move(scanInfo), std::move(scanRelInfo),
            std::move(prevOperator), getOperatorID(), printInfo->copy());
    }
    // map to generic extend
    auto directionInfo = DirectionInfo();
    directionInfo.extendFromSource = extend->extendFromSourceNode();
    if (rel->hasDirectionExpr()) {
        directionInfo.directionPos = getDataPos(*rel->getDirectionExpr(), *outFSchema);
    }
    table_id_map_t<RelTableCollectionScanner> scanners;
    for (auto boundNodeTableID : boundNode->getTableIDs()) {
        for (auto entry : rel->getEntries()) {
            auto& relGroupEntry = entry->constCast<RelGroupCatalogEntry>();
            auto scanInfos =
                populateRelTableCollectionScanner(boundNodeTableID, nbrNode->getTableIDsSet(),
                    relGroupEntry, extendDirection, extend->shouldScanNbrID(),
                    extend->getProperties(), extend->getPropertyPredicates(), clientContext);
            if (scanInfos.empty()) {
                continue;
            }
            if (scanners.contains(boundNodeTableID)) {
                scanners.at(boundNodeTableID).addRelInfos(std::move(scanInfos));
            } else {
                scanners.insert(
                    {boundNodeTableID, RelTableCollectionScanner(std::move(scanInfos))});
            }
        }
    }
    return std::make_unique<ScanMultiRelTable>(std::move(scanInfo), std::move(directionInfo),
        std::move(scanners), std::move(prevOperator), getOperatorID(), printInfo->copy());
}

} // namespace processor
} // namespace lbug