.png){kind=icon}
.png){kind=icon}
Return
Indexing Techniques for Graph Reachability Queries
.png){kind=icon}
PRE
AI
DOI：10.1145/3776737.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We survey graph reachability indexing techniques for efficiently processing reachability queries in two popular graph models: plain graphs and edge-labeled graphs. Reachability queries determine whether a directed path exists between a source and a target vertex, forming a core class of navigational queries in graph analytics. Reachability indexes are specialized data structures that accelerate such query processing. Work on this topic goes back four decades-we include 33 of the proposed techniques. Plain graphs consist of only vertices and edges, with reachability queries checking for the existence of a path. Edge-labeled graphs extend plain graphs by adding labels to edges, and their queries further impose constraints on the labels along the path. We categorize indexing techniques for both plain and edge-labeled graphs and discuss them based on this classification, using representative methods to illustrate key ideas. We discuss the main challenges within each category and how these might be addressed in other approaches. We conclude with a discussion of the open challenges and future research directions, along the lines of integrating reachability indexes into modern graph database management systems. This survey serves as a comprehensive resource for researchers and practitioners interested in the advancements, techniques, and challenges of reachability indexing in graph analytics.
Keywords:
Graph processing
graph databases
reachability query
reachability index
Journal
IF:
28
Papers:
2.4K
Citations:
3.5W