Back to papers
Efficiently Answering Reachability Queries on Very Large Directed Graphs
Summary: Introduces path-tree, a tree-shaped spanning subgraph to aid reachability labeling on very large directed graphs. Path-tree cover yields scalable reachability labels and outperforms traditional interval/2-hop approaches, with analytic and empirical validation.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 4019
- Venue
- SIGMOD
- Year
- 2008
- Pagerank
- 0.00016648392
- Overall Rank
- 784 | 94.56%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 27 of 27 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 280 |
3-HOP: A High-Compression Indexing Scheme for Reachability Query |
2009 |
SIGMOD |
0.00029092277 |
| 377 |
TEDI: Efficient Shortest Path Query Answering on Graphs |
2010 |
SIGMOD |
0.00025074538 |
| 502 |
On Graph Query Optimization in Large Networks |
2010 |
VLDB |
0.00021528261 |
| 727 |
GRAIL: Scalable Reachability Index for Large Graphs |
2010 |
VLDB |
0.00017462279 |
| 1,551 |
A Memory Efficient Reachability Data Structure Through Bit Vector Compression |
2011 |
SIGMOD |
0.00011395294 |
| 1,572 |
Query Preserving Graph Compression |
2012 |
SIGMOD |
0.00011296109 |
| 1,776 |
Reachability Queries on Large Dynamic Graphs: A Total Order Approach |
2014 |
SIGMOD |
0.0001058029 |
| 2,762 |
K-Reach: Who is in Your Small World |
2012 |
VLDB |
8.1614818e-05 |
| 2,958 |
Computing Label-Constraint Reachability in Graph Databases |
2010 |
SIGMOD |
7.8126329e-05 |
| 3,130 |
SCARAB: Scaling Reachability Computation on Large Graphs |
2012 |
SIGMOD |
7.5054361e-05 |
| 3,234 |
Managing Large Dynamic Graphs Efficiently |
2012 |
SIGMOD |
7.3302974e-05 |
| 3,676 |
Simple, Fast, and Scalable Reachability Oracle |
2013 |
VLDB |
6.8500097e-05 |
| 4,478 |
Reachability Querying: An Independent Permutation Labeling Approach |
2014 |
VLDB |
6.1452192e-05 |
| 5,030 |
Making Graphs Compact by Lossless Contraction |
2021 |
SIGMOD |
5.7445683e-05 |
| 5,488 |
Microblog Entity Linking with Social Temporal Context |
2015 |
SIGMOD |
5.4798261e-05 |
| 5,816 |
An Optimal Labeling Scheme for Workflow Provenance Using Skeleton Labels |
2010 |
SIGMOD |
5.3158435e-05 |
| 6,660 |
On Querying Historical Connectivity in Temporal Graphs |
2024 |
SIGMOD |
4.9672425e-05 |
| 7,179 |
A Hierarchical Contraction Scheme for Querying Big Graphs |
2022 |
SIGMOD |
4.803776e-05 |
| 7,430 |
DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs |
2022 |
VLDB |
4.7275494e-05 |
| 7,595 |
DAG Reduction: Fast Answering Reachability Queries |
2017 |
SIGMOD |
4.6980168e-05 |
| 7,714 |
Minimum Strongly Connected Subgraph Collection in Dynamic Graphs |
2024 |
VLDB |
4.6651585e-05 |
| 7,863 |
Adaptive Optimizations of Recursive Queries in Teradata |
2012 |
SIGMOD |
4.628688e-05 |
| 8,056 |
Labeling Recursive Workflow Executions On-the-Fly |
2011 |
SIGMOD |
4.5903524e-05 |
| 9,042 |
HR-Index: An Effective Index Method for Historical Reachability Queries over Evolving Graphs |
2023 |
SIGMOD |
4.3997447e-05 |
| 9,737 |
The Space-Efficient Core of Vadalog |
2019 |
PODS |
4.2895392e-05 |
| 11,034 |
Poligras: Policy-based Graph Summarization |
2024 |
VLDB |
4.1905499e-05 |
| 11,507 |
Preference Queries over Taxonomic Domains |
2021 |
VLDB |
4.1905499e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 3,676 |
Simple, Fast, and Scalable Reachability Oracle |
2013 |
VLDB |
6.8500097e-05 |
| 2,762 |
K-Reach: Who is in Your Small World |
2012 |
VLDB |
8.1614818e-05 |
| 5,548 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
5.4445937e-05 |
| 4,070 |
Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach |
2012 |
SIGMOD |
6.4739921e-05 |
| 7,430 |
DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs |
2022 |
VLDB |
4.7275494e-05 |
| 6,796 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
4.9195203e-05 |
| 4,478 |
Reachability Querying: An Independent Permutation Labeling Approach |
2014 |
VLDB |
6.1452192e-05 |
| 9,485 |
I/O Efficient Label-Constrained Reachability Queries in Large Graphs |
2024 |
VLDB |
4.3300131e-05 |
| 1,776 |
Reachability Queries on Large Dynamic Graphs: A Total Order Approach |
2014 |
SIGMOD |
0.0001058029 |
| 2,958 |
Computing Label-Constraint Reachability in Graph Databases |
2010 |
SIGMOD |
7.8126329e-05 |