Graph Databases and Endogenous Indices
• Many indices are trees.8
• A tree is a type of constrained graph.9
• You can represent a tree with a graph.10
Even an “index” that is simply an O(n) container can be represented as a graph (e.g. linked list).
A tree is an acyclic connected graph with each vertex having at most one parent.
This follows as a consequence of a tree being a graph.