lbug 0.15.4

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

#include "planner/operator/scan/logical_index_look_up.h"

#include "binder/expression/expression_util.h"

namespace lbug {
namespace planner {

std::string LogicalPrimaryKeyLookup::getExpressionsForPrinting() const {
    binder::expression_vector expressions;
    for (auto& info : infos) {
        expressions.push_back(info.offset);
    }
    return binder::ExpressionUtil::toString(expressions);
}

void LogicalPrimaryKeyLookup::computeFactorizedSchema() {
    copyChildSchema(0);
    for (auto& info : infos) {
        auto groupPos = 0u;
        if (schema->isExpressionInScope(*info.key)) {
            groupPos = schema->getGroupPos(*info.key);
        }
        schema->insertToGroupAndScope(info.offset, groupPos);
    }
}

void LogicalPrimaryKeyLookup::computeFlatSchema() {
    copyChildSchema(0);
    for (auto& info : infos) {
        schema->insertToGroupAndScope(info.offset, 0);
    }
}

} // namespace planner
} // namespace lbug