An Overview of Reachability Indexes on Graphs

Abstract

Graphs have been the natural choice for modeling entities and the relationships among them. One of the most fundamental graph processing operators is a reachability query, which checks whether a path exists from the source to the target vertex in a plain graph, and additionally whether the path can satisfy a given path constraint based on the edge labels in an edge-labeled graph. Processing reachability queries requires potentially visiting a large portion of the graph due to the inherent transitivity of these queries. This makes it costly to evaluate them on large graphs. Thus, significant effort has been spent to design indexing techniques for reachability queries in the last three decades, building advanced data structures to efficiently compress the transitive closure of the graph so as to accelerate online query processing, aka reachability indexes. In this tutorial, we provide an in-depth technical review of the existing reachability indexes, ranging from those designed for plain graphs to ones for edge-labeled graphs. We conclude the tutorial by summarizing the open challenges for integrating these techniques into GDBMSs.