Method bindGraphPattern

src/binder/bind/bind_graph_pattern.cpp:36–45

A graph pattern contains node/rel and a set of key-value pairs associated with the variable. We bind node/rel as query graph and key-value pairs as a separate collection. This collection is interpreted in two different ways. - In MATCH clause, these are additional predicates to WHERE clause - In UPDATE clause, there are properties to set. We do not store key-value pairs in query graph primarily be

// We do not store key-value pairs in query graph primarily because we will merge key-value
// std::pairs with other predicates specified in WHERE clause.
BoundGraphPattern Binder::bindGraphPattern(const std::vector<PatternElement>& graphPattern) {
    auto queryGraphCollection = QueryGraphCollection();
    for (auto& patternElement : graphPattern) {
        queryGraphCollection.addAndMergeQueryGraphIfConnected(bindPatternElement(patternElement));
    }
    queryGraphCollection.finalize();
    auto boundPattern = BoundGraphPattern();
    boundPattern.queryGraphCollection = std::move(queryGraphCollection);
    return boundPattern;
}

// Grammar ensures pattern element is always connected and thus can be bound as a query graph.
QueryGraph Binder::bindPatternElement(const PatternElement& patternElement) {