DBScholar

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
h3c581da0803f2276
Venue
SIGMOD
Year
2008
Pagerank
0.00014049427
Overall Rank
779 | 94.78%
DOI
10.1145/1376616.1376677

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{jin_sigmod08,
        title = {{Efficiently Answering Reachability Queries on Very Large Directed Graphs}},
        author = {Jin, Ruoming and Xiang, Yang and Ruan, Ning and Wang, Haixun},
        series = {{SIGMOD} '08},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1376616.1376677},
        url = {https://dl.acm.org/doi/10.1145/1376616.1376677},
        year = {2008}
}

Incoming Citations (Sorted by Pagerank)

Showing 27 of 27 citing papers.

Rank Citing Paper Year Venue Pagerank
269 3-HOP: A High-Compression Indexing Scheme for Reachability Query 2009 SIGMOD 0.00022625826
356 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020086045
376 TEDI: Efficient Shortest Path Query Answering on Graphs 2010 SIGMOD 0.00019655871
694 GRAIL: Scalable Reachability Index for Large Graphs 2010 VLDB 0.00014681018
1,341 A Memory Efficient Reachability Data Structure Through Bit Vector Compression 2011 SIGMOD 0.00010960707
1,376 Query Preserving Graph Compression 2012 SIGMOD 0.00010857788
1,859 Reachability Queries on Large Dynamic Graphs: A Total Order Approach 2014 SIGMOD 9.4722343e-05
2,541 Computing Label-Constraint Reachability in Graph Databases 2010 SIGMOD 8.3021057e-05
2,568 SCARAB: Scaling Reachability Computation on Large Graphs 2012 SIGMOD 8.2649684e-05
2,617 K-Reach: Who is in Your Small World 2012 VLDB 8.2001569e-05
3,167 Managing Large Dynamic Graphs Efficiently 2012 SIGMOD 7.5594359e-05
3,357 Simple, Fast, and Scalable Reachability Oracle 2013 VLDB 7.3652047e-05
4,076 Reachability Querying: An Independent Permutation Labeling Approach 2014 VLDB 6.8048601e-05
5,571 Making Graphs Compact by Lossless Contraction 2021 SIGMOD 6.0628752e-05
5,732 Microblog Entity Linking with Social Temporal Context 2015 SIGMOD 5.9963673e-05
5,748 An Optimal Labeling Scheme for Workflow Provenance Using Skeleton Labels 2010 SIGMOD 5.9914851e-05
6,209 On Querying Historical Connectivity in Temporal Graphs 2024 SIGMOD 5.8323161e-05
6,786 DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs 2022 VLDB 5.6657191e-05
7,034 A Hierarchical Contraction Scheme for Querying Big Graphs 2022 SIGMOD 5.5998447e-05
7,743 Minimum Strongly Connected Subgraph Collection in Dynamic Graphs 2024 VLDB 5.4465939e-05
7,861 DAG Reduction: Fast Answering Reachability Queries 2017 SIGMOD 5.4225547e-05
8,067 Adaptive Optimizations of Recursive Queries in Teradata 2012 SIGMOD 5.3810658e-05
8,216 Labeling Recursive Workflow Executions On-the-Fly 2011 SIGMOD 5.3600428e-05
9,324 HR-Index: An Effective Index Method for Historical Reachability Queries over Evolving Graphs 2023 SIGMOD 5.1815803e-05
10,089 The Space-Efficient Core of Vadalog 2019 PODS 5.068571e-05
11,629 Poligras: Policy-based Graph Summarization 2024 VLDB 4.9605343e-05
12,056 Preference Queries over Taxonomic Domains 2021 VLDB 4.9605343e-05
Previous Page 1 / 1 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers