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 c