lbug 0.17.0

An in-process property graph database management system built for query speed and scalability
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

#pragma once

#include "logical_operator_visitor.h"
#include "planner/operator/logical_plan.h"

namespace lbug {
namespace optimizer {

/* When UNWIND is followed by MERGE, duplicate values in the UNWIND list can cause
 * issues because the MERGE's HASH_JOIN doesn't see newly created nodes within the same batch.
 * This optimizer inserts a UNWIND_DEDUP operator to deduplicate MERGE input rows.
 *
 * E.g., UNWIND [1, 1, 2] AS x MERGE (a:A {val: x})
 * Before: UNWIND -> HASH_JOIN (for optional match) -> MERGE
 * After:  UNWIND -> HASH_JOIN (for optional match) -> UNWIND_DEDUP -> MERGE
 */
class UnwindDedupOptimizer : public LogicalOperatorVisitor {
public:
    void rewrite(planner::LogicalPlan* plan);

private:
    std::shared_ptr<planner::LogicalOperator> visitOperator(
        const std::shared_ptr<planner::LogicalOperator>& op, bool isRoot = false);

    std::shared_ptr<planner::LogicalOperator> visitMergeReplace(
        std::shared_ptr<planner::LogicalOperator> op) override;

    bool canRewriteCurrentMerge = false;
};

} // namespace optimizer
} // namespace lbug