Neo4j

Hi everyone! I'm trying to query the following pattern: (a)-[r1]->(b)-[r1|r2*]->(c)-[r1]->(d) and a, b, c, d might belong to different categories, and they all have the same label.    The Cypher query I'm running is (cat means category): MATCH p=(a)-...

For example, if I want to match a pattern like this: MATCH (:Person)-[:A]->(:Movie)-[:B*]->(:Movie)-[:C]->(:Person) where the first and last relationship's length ([:A] and [:C]) is fixed (they are both with length 1), but the middle relationship's l...

I'm wondering does Cypher (runtime) apply the traversal framework (The traversal framework - Java Reference)? Or they are actually two different ways of accessing the graph? (which means their implementations are totally different) And if they are ...

Hello, I understand that the task of executing a query is decomposed into operators, and these operators will are combined into a tree-like structure called an execution plan. My questions are: (a) Do these operators actually traverse the graph? (b)...