lbug 0.16.0

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

#include "planner/operator/logical_partitioner.h"

#include "binder/expression/expression_util.h"
#include "common/exception/runtime.h"

namespace lbug {
namespace planner {

static void validateSingleGroup(const Schema& schema) {
    if (schema.getNumGroups() != 1) {
        throw common::RuntimeException(
            "Try to partition multiple factorization group. This should not happen.");
    }
}

void LogicalPartitioner::computeFactorizedSchema() {
    copyChildSchema(0);
    // LCOV_EXCL_START
    validateSingleGroup(*schema);
    // LCOV_EXCL_STOP
    schema->insertToGroupAndScope(info.offset, 0);
}

void LogicalPartitioner::computeFlatSchema() {
    copyChildSchema(0);
    // LCOV_EXCL_START
    validateSingleGroup(*schema);
    // LCOV_EXCL_STOP
    schema->insertToGroupAndScope(info.offset, 0);
}

std::string LogicalPartitioner::getExpressionsForPrinting() const {
    binder::expression_vector expressions;
    for (auto& partitioningInfo : info.partitioningInfos) {
        expressions.push_back(copyFromInfo.columnExprs[partitioningInfo.keyIdx]);
    }
    return binder::ExpressionUtil::toString(expressions);
}

} // namespace planner
} // namespace lbug