DBScholar

Back to papers

Simple, Fast, and Scalable Reachability Oracle

Summary: Introduces Hierarchical- and Distribution-Labeling reachability oracles that avoid transitive-closure materialization and costly set cover. On massive real-world graphs, they construct an order of magnitude faster while outperforming closure compression and online search in index size and query speed. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
10871
Venue
VLDB
Year
2013
Pagerank
7.5712342e-05
Overall Rank
3,278 | 77.52%
DOI
10.14778/2556549.2556578

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{jin_vldb13,
        title = {{Simple, Fast, and Scalable Reachability Oracle}},
        author = {Jin, Ruoming and Wang, Guan},
        journal = {PVLDB},
        series = {{VLDB} '13},
        volume = {6},
        number = {14},
        pages = {1978--1989},
        doi = {10.14778/2556549.2556578},
        url = {https://doi.org/10.14778/2556549.2556578},
        year = {2013}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Rank Citing Paper Year Venue Pagerank
927 Real-time Constrained Cycle Detection in Large Dynamic Graphs 2018 VLDB 0.00013161079
1,796 Reachability Queries on Large Dynamic Graphs: A Total Order Approach 2014 SIGMOD 9.7380494e-05
2,700 Landmark Indexing for Evaluation of Label-Constrained Reachability Queries 2017 SIGMOD 8.2411888e-05
3,979 Reachability Querying: An Independent Permutation Labeling Approach 2014 VLDB 6.9754185e-05
5,590 Microblog Entity Linking with Social Temporal Context 2015 SIGMOD 6.1557283e-05
6,603 Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond 2020 VLDB 5.824568e-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
9,132 HR-Index: An Effective Index Method for Historical Reachability Queries over Evolving Graphs 2023 SIGMOD 5.31719e-05
9,625 I/O Efficient Label-Constrained Reachability Queries in Large Graphs 2024 VLDB 5.2434488e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 15 of 15 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
195 Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling 2013 SIGMOD 0.00025813775
269 3-HOP: A High-Compression Indexing Scheme for Reachability Query 2009 SIGMOD 0.00022786599
282 Efficient Management of Transitive Relationships in Large Data and Knowledge Bases 1989 SIGMOD 0.0002242162
322 Fast and Practical Indexing and Querying of Very Large Graphs 2007 SIGMOD 0.00021275303
444 Stack-based Algorithms for Pattern Matching on DAGs 2005 VLDB 0.00018350865
679 GRAIL: Scalable Reachability Index for Large Graphs 2010 VLDB 0.00015055389
746 Efficiently Answering Reachability Queries on Very Large Directed Graphs 2008 SIGMOD 0.00014402233
1,254 Distance-Constraint Reachability Computation in Uncertain Graphs 2011 VLDB 0.0001147266
1,301 A Memory Efficient Reachability Data Structure Through Bit Vector Compression 2011 SIGMOD 0.00011255351
1,533 TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph 2013 SIGMOD 0.00010467148
1,622 IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying 2013 VLDB 0.00010201102
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
5,029 Performance Guarantees for Distributed Reachability Queries 2012 VLDB 6.3960846e-05
5,393 Efficient Reachability Query Evaluation in Large Spatiotemporal Contact Datasets 2012 VLDB 6.2337766e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 7,322 DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs 2022 VLDB
2 7,211 Toward a Distance Oracle for Billion-Node Graphs 2014 VLDB
3 8,651 Distributed Set Reachability 2016 SIGMOD
4 1,533 TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph 2013 SIGMOD
5 6,603 Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond 2020 VLDB
6 1,796 Reachability Queries on Large Dynamic Graphs: A Total Order Approach 2014 SIGMOD
7 2,490 Computing Label-Constraint Reachability in Graph Databases 2010 SIGMOD
8 9,625 I/O Efficient Label-Constrained Reachability Queries in Large Graphs 2024 VLDB
9 746 Efficiently Answering Reachability Queries on Very Large Directed Graphs 2008 SIGMOD
10 3,979 Reachability Querying: An Independent Permutation Labeling Approach 2014 VLDB