Query Patterns and Performance

The Neo4j graph engine is implemented to traverseiFull definition for traversal (opens in a new tab)Following relationships from one node to the next to reach other parts of a graph. relationshipsiFull 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. very quickly. As you become more experienced with CypheriFull 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. queries, you will soon learn that there are multiple ways to write a query that returns the same results. The difference in queries is typically its traversal performance. In this lesson, you will begin learning about graph traversal and query performance.

A patterniFull definition for pattern (opens in a new tab)A graph structure written in Cypher, such as a node joined to another node by a relationship. is a combination of nodesiFull definition for node (opens in a new tab)A vertex in a graph. In a property graph it can carry labels and properties. and relationships that is used to traverse the graph at runtime. You can write queries that test whether a pattern exists in the graph.