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

#pragma once

#include "planner/operator/schema.h"

namespace lbug {
namespace planner {

// This class contains the logic for re-computing factorization structure after sinking
class SinkOperatorUtil {
public:
    static void mergeSchema(const Schema& inputSchema,
        const binder::expression_vector& expressionsToMerge, Schema& resultSchema);

    static void recomputeSchema(const Schema& inputSchema,
        const binder::expression_vector& expressionsToMerge, Schema& resultSchema);

private:
    static std::unordered_map<f_group_pos, binder::expression_vector> getUnFlatPayloadsPerGroup(
        const Schema& schema, const binder::expression_vector& payloads);

    static binder::expression_vector getFlatPayloads(const Schema& schema,
        const binder::expression_vector& payloads);

    static uint32_t appendPayloadsToNewGroup(Schema& schema, binder::expression_vector& payloads);
};

} // namespace planner
} // namespace lbug