Some Graph Traversal Use Cases
• Local searches — “What is in the neighborhood around
• Local recommendations — “Given A, what should A
include in their neighborhood?”17
• Local ranks — “Given A, how would you rank B relative to
A can be an individual vertex or a set of vertices. This set is known as the root vertex set.
Recommendation can be seen as trying to increase the connectivity of the graph by recommending
vertices (e.g. items) for another vertex (e.g. person) to extend an edge to (e.g. purchased).
In this presentation, there will be no examples provided for this use case. However, note that searching,
ranking, and recommendation are presented in the WindyCityDB OpenLab Graph Database Tutorial. Other
terms for local rank are “rank with priors” or “relative rank.”