Efficiently Answering Regular Simple Path Queries on Large Labeled Networks
Summary: Introduces ARRIVAL, a random-walk sampling method for RSP queries on large labeled graphs. Delivers theoretical guarantees of quality; ~100x faster than baselines on billion-scale graphs with ~95% accuracy for SPARQL/Cypher-like queries. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sarisht Wadhwa (Indian Institute of Technology Delhi)
- 2. Anagh Prasad (Indian Institute of Technology Delhi)
- 3. Sayan Ranu (Indian Institute of Technology Delhi)
- 4. Amitabha Bagchi (Indian Institute of Technology Delhi)
- 5. Srikanta Bedathur (Indian Institute of Technology Delhi)
BibTeX Citation
@inproceedings{wadhwa_sigmod19,
title = {{Efficiently Answering Regular Simple Path Queries on Large Labeled Networks}},
author = {Wadhwa, Sarisht and Prasad, Anagh and Ranu, Sayan and Bagchi, Amitabha and Bedathur, Srikanta},
series = {{SIGMOD} '19},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3299869.3319882},
url = {https://dl.acm.org/doi/10.1145/3299869.3319882},
year = {2019}
}
Incoming Citations (Sorted by Pagerank)
Showing 12 of 12 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 305 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.0002159111 |
| 356 | Regular Path Queries with Constraints | 1997 | PODS | 0.00020103855 |
| 540 | An Analytical Study of Large SPARQL Query Logs | 2018 | VLDB | 0.00016726545 |
| 2,041 | Rewriting of Regular Expressions and Regular Path Queries | 1999 | PODS | 9.1421879e-05 |
| 2,534 | Computing Label-Constraint Reachability in Graph Databases | 2010 | SIGMOD | 8.3335732e-05 |
| 2,734 | Landmark Indexing for Evaluation of Label-Constrained Reachability Queries | 2017 | SIGMOD | 8.0789676e-05 |
| 3,420 | Query Planning for Evaluating SPARQL Property Paths | 2016 | SIGMOD | 7.3147525e-05 |
| 5,109 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS | 6.2695208e-05 |
| 5,808 | Walk, Not Wait: Faster Sampling Over Online Social Networks | 2015 | VLDB | 5.9876214e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,049 | Reachability Querying: An Independent Permutation Labeling Approach | 2014 | VLDB |
| 2 | 11,481 | Distinct Shortest Walk Enumeration for RPQs | 2024 | PODS |
| 3 | 8,211 | LM-SRPQ: Efficiently Answering Regular Path Query in Streaming Graphs | 2024 | VLDB |
| 4 | 2,534 | Computing Label-Constraint Reachability in Graph Databases | 2010 | SIGMOD |
| 5 | 2,734 | Landmark Indexing for Evaluation of Label-Constrained Reachability Queries | 2017 | SIGMOD |
| 6 | 1,597 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB |
| 7 | 2,257 | Regular Path Query Evaluation on Streaming Graphs | 2020 | SIGMOD |
| 8 | 774 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD |
| 9 | 11,891 | Answering Regular Path Queries through Exemplars | 2022 | VLDB |
| 10 | 11,561 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB |