Why is 'Index-Free Adjacency' in Graph Databases (like Neo4j) theoretically superior to Relational Joins for deep traversals?

1. A It leverages advanced machine learning models to predict the most likely traversal path across the graph, eliminating the need for hard disk I/O.
2. B It utilizes a specialized, lossless compression algorithm that allows hundreds of nodes and relationships to be packed into a single, high-efficiency data block.
3. C Each node physically stores the memory offsets or IDs of its neighbors, allowing for O(1) pointer-chasing instead of O(log N) indexed set-joins.
4. D It implements a transparent, global caching layer that automatically saves the results of every previous traversal to ensure that duplicate queries are never re-evaluated.