Multi-Hop Traversals for Recommendations
4.4 · Lesson (Optional)

Multi-Hop Traversals for Recommendations

You created CONTAINS Full definition for relationship (opens in a new tab)A named, directed connection between two nodes. Every relationship has a type, a start node and an end node. and completed the Customer→Order→Product path. Now you'll see the full power of graph Full definition for traversal (opens in a new tab)Following relationships from one node to the next to reach other parts of a graph..

In this lesson, you will learn how to write multi-hop queries that would be nightmares in SQL but are natural in Full definition for Cypher (opens in a new tab)Neo4j's implementation of GQL, the ISO standard query language for graph databases. It is declarative: you describe the pattern to find, and the database decides how to find it..