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

#include "planner/operator/logical_flatten.h"
#include "planner/planner.h"

namespace lbug {
namespace planner {

void Planner::appendFlattens(const f_group_pos_set& groupsPos, LogicalPlan& plan) {
    for (auto groupPos : groupsPos) {
        appendFlattenIfNecessary(groupPos, plan);
    }
}

void Planner::appendFlattenIfNecessary(f_group_pos groupPos, LogicalPlan& plan) {
    auto group = plan.getSchema()->getGroup(groupPos);
    if (group->isFlat()) {
        return;
    }
    auto flatten = make_shared<LogicalFlatten>(groupPos, plan.getLastOperator(),
        cardinalityEstimator.estimateFlatten(plan.getLastOperatorRef(), groupPos));
    flatten->computeFactorizedSchema();
    plan.setLastOperator(std::move(flatten));
}

} // namespace planner
} // namespace lbug