A super fast Graph Database uses GraphBLAS under the hood for its sparse adjacency matrix graph representation. Our goal is to provide the best Knowledge Graph for LLM (GraphRAG).
MATCH (n0)-[r0]-(n1)-[r1]-(n2) WHERE true RETURN n0.id, r0.id, n1.id, r1.id, n2.id
There should be no result, as such a pattern does not exist if we do not count repetitive relations (assigning relation 24 to both r0 and r1), and other Cypher-based databases indeed follow this rule, for example Memgraph and neo4j:
However, FalkorDB violates this property and give the result:
Such inconsistency with the standard could cause trouble when programming with FalkorDB. Fix would be very appreciated. Thank you!
FalkorDB seems to violate the uniqueness requirements when matching relations, as specified in the openCypher standard, chapter "Pattern-Uniqueness"(https://s3.amazonaws.com/artifacts.opencypher.org/openCypher9.pdf):
For example, suppose we build a database using the following queries:
And then run the Cypher query:
There should be no result, as such a pattern does not exist if we do not count repetitive relations (assigning relation 24 to both r0 and r1), and other Cypher-based databases indeed follow this rule, for example Memgraph and neo4j:
However, FalkorDB violates this property and give the result:
Such inconsistency with the standard could cause trouble when programming with FalkorDB. Fix would be very appreciated. Thank you!