Reachability Querying: An Independent Permutation Labeling Approach
Summary: Independent-permutation randomized labeling for reachability queries. Claims to be the first approach using independent permutations, achieving linear-time construction and index size with fast querying that avoids run-time DFS; validated on 19 real and synthetic datasets showing efficiency. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Hao Wei (Chinese University of Hong Kong)
- 2. Jeffrey Xu Yu (Chinese University of Hong Kong)
- 3. Can Lu (Chinese University of Hong Kong)
- 4. Ruoming Jin (Kent State University)
BibTeX Citation
@article{wei_vldb14,
title = {{Reachability Querying: An Independent Permutation Labeling Approach}},
author = {Wei, Hao and Yu, Jeffrey Xu and Lu, Can and Jin, Ruoming},
journal = {PVLDB},
series = {{VLDB} '14},
volume = {7},
number = {12},
pages = {1191},
doi = {10.14778/2732977.2732992},
url = {https://doi.org/10.14778/2732977.2732992},
year = {2014}
}Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 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,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 |
| 3,021 | SCARAB: Scaling Reachability Computation on Large Graphs | 2012 | SIGMOD | 7.8401031e-05 |
| 3,278 | Simple, Fast, and Scalable Reachability Oracle | 2013 | VLDB | 7.5712342e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,575 | K-Reach: Who is in Your Small World | 2012 | VLDB |
| 2 | 1,622 | IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying | 2013 | VLDB |
| 3 | 5,044 | Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs | 2021 | VLDB |
| 4 | 7,322 | DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs | 2022 | VLDB |
| 5 | 2,490 | Computing Label-Constraint Reachability in Graph Databases | 2010 | SIGMOD |
| 6 | 6,603 | Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond | 2020 | VLDB |
| 7 | 3,278 | Simple, Fast, and Scalable Reachability Oracle | 2013 | VLDB |
| 8 | 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |
| 9 | 746 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD |
| 10 | 9,625 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB |