Chapter 8. Traversals in depth
This chapter covers
- How traversal ordering impacts performance and memory footprint
- Using expanders during traversal
- Controlling the number of visits to each node using the uniqueness property
- Improving graph query performance using bidirectional traversals
Writing efficient traversals is the key to successfully querying graph data. You learned the basic concepts of the Neo4j Traversal API in chapter 4. In this chapter we’re going to dig a little deeper into the inner workings of the Traversal API so you can learn how to solve the most complex graph problems in an efficient manner.
8.1. Traversal ordering
Every time a traverser visits a node, it needs to make a decision about which relationship to follow ...
Get Neo4j in Action now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
