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
4080
Venue
SIGMOD
Year
2008
Pagerank
0.00014402233
Overall Rank
746 | 94.89%
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.00022786599
352 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020375193
370 TEDI: Efficient Shortest Path Query Answering on Graphs 2010 SIGMOD 0.00019937972
679 GRAIL: Scalable Reachability Index for Large Graphs 2010 VLDB 0.00015055389
1,301 A Memory Efficient Reachability Data Structure Through Bit Vector Compression 2011 SIGMOD 0.00011255351
1,336 Query Preserving Graph Compression 2012 SIGMOD 0.00011118804
1,796 Reachability Queries on Large Dynamic Graphs: A Total Order Approach 2014 SIGMOD 9.7380494e-05
2,490 Computing Label-Constraint Reachability in Graph Databases 2010 SIGMOD 8.5090456e-05
2,575 K-Reach: Who is in Your Small World 2012 VLDB 8.3982298e-05
3,021 SCARAB: Scaling Reachability Computation on Large Graphs 2012 SIGMOD 7.8401031e-05
3,109 Managing Large Dynamic Graphs Efficiently 2012 SIGMOD 7.7482727e-05
3,278 Simple, Fast, and Scalable Reachability Oracle 2013 VLDB 7.5712342e-05
3,979 Reachability Querying: An Independent Permutation Labeling Approach 2014 VLDB 6.9754185e-05
5,415 Making Graphs Compact by Lossless Contraction 2021 SIGMOD 6.2255551e-05
5,590 Microblog Entity Linking with Social Temporal Context 2015 SIGMOD 6.1557283e-05
5,724 An Optimal Labeling Scheme for Workflow Provenance Using Skeleton Labels 2010 SIGMOD 6.108728e-05
6,075 On Querying Historical Connectivity in Temporal Graphs 2024 SIGMOD 5.9853864e-05
6,876 A Hierarchical Contraction Scheme for Querying Big Graphs 2022 SIGMOD 5.7483615e-05
7,322 DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs 2022 VLDB 5.644647e-05
7,578 Minimum Strongly Connected Subgraph Collection in Dynamic Graphs 2024 VLDB 5.5927377e-05
7,707 DAG Reduction: Fast Answering Reachability Queries 2017 SIGMOD 5.5636745e-05
7,891 Adaptive Optimizations of Recursive Queries in Teradata 2012 SIGMOD 5.5211516e-05
8,049 Labeling Recursive Workflow Executions On-the-Fly 2011 SIGMOD 5.500317e-05
9,132 HR-Index: An Effective Index Method for Historical Reachability Queries over Evolving Graphs 2023 SIGMOD 5.31719e-05
9,863 The Space-Efficient Core of Vadalog 2019 PODS 5.2045536e-05
11,241 Poligras: Policy-based Graph Summarization 2024 VLDB 5.093636e-05
11,701 Preference Queries over Taxonomic Domains 2021 VLDB 5.093636e-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