Graph databases use endogenous indices to index vertices by their properties. This allows for efficient lookups of vertices that match specific property values. For example, a graph database may have indices on the "name" and "views" properties of vertices to enable fast lookups of vertices by those property values. The indices are part of the graph structure itself rather than being an external component.

24. The Graph Traversal Pa
name=...
2
friend
name=Alberto Pepe name=...
1 friend 3
name=...
eout friend
4
efriend
lab+
vin ✏name

30. Graph Databases and Endogenous Indices
name property index
Graph Databases Make Use o
views property index gender property index
page_rank=0.023
created
cites
name=neo4j
views=56781
created
cites
created
name=tenderlove
gender=male
A B C
} Ind
}
date=2007/10
cites
follows
follows
created
name=peterneubauer follows
name=graph_blog follows
views=1000 follows
D E
created
name=ahzf
name=twarko
age=30
• There is more to the graph than the explicit
• Indices index the vertices, by their properties (

31. B E
A
A B C
D E
C D

34. B E
A D G
C F

36. Graph Databases and Endogenous Indices
name property index
views property index gender property index
name=neo4j
views=56781
page_rank=0.023 cites
cites
name=tenderlove
gender=male
created
created
created
date=2007/10
cites
follows
follows
created
name=peterneubauer follows
name=graph_blog follows
views=1000 follows
created
name=ahzf
name=twarko
age=30