Answering Regular Path Queries through Exemplars
Summary: RQUBE infers regular path queries from an exemplar source–target pair, removing the need for users to specify regexes. It combines Biermann–Feldman inference with NFA-guided random walks, achieving >90% accuracy and 3+ orders-of-magnitude speedups on million-node graphs. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Komal Chauhan (Indian Institute of Technology Delhi)
- 2. Kartik Jain (Indian Institute of Technology Delhi)
- 3. Sayan Ranu (Indian Institute of Technology Delhi)
- 4. Srikanta Bedathur (Indian Institute of Technology Delhi)
- 5. Amitabha Bagchi (Indian Institute of Technology Delhi)
BibTeX Citation
@article{chauhan_vldb22,
title = {{Answering Regular Path Queries through Exemplars}},
author = {Chauhan, Komal and Jain, Kartik and Ranu, Sayan and Bedathur, Srikanta and Bagchi, Amitabha},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {2},
pages = {299--311},
doi = {10.14778/3489496.3489510},
url = {https://doi.org/10.14778/3489496.3489510},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 65 | Freebase: A Collaboratively Created Graph Database For Structuring Human Knowledge | 2008 | SIGMOD | 0.00038697603 |
| 900 | G-CORE: A Core for Future Graph Query Languages | 2018 | SIGMOD | 0.00013337186 |
| 2,209 | Regular Path Query Evaluation on Streaming Graphs | 2020 | SIGMOD | 8.9437338e-05 |
| 2,490 | Computing Label-Constraint Reachability in Graph Databases | 2010 | SIGMOD | 8.5090456e-05 |
| 2,700 | Landmark Indexing for Evaluation of Label-Constrained Reachability Queries | 2017 | SIGMOD | 8.2411888e-05 |
| 3,473 | Efficiently Answering Regular Simple Path Queries on Large Labeled Networks | 2019 | SIGMOD | 7.3864987e-05 |
| 6,603 | Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond | 2020 | VLDB | 5.824568e-05 |
| 8,206 | Mining Top-k Pairs of Correlated Subgraphs in a Large Network | 2020 | VLDB | 5.4666548e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,215 | cuRPQ: A High-Performance GPU-Based Framework for Processing Regular and Conjunctive Regular Path Queries | 2026 | SIGMOD |
| 2 | 8,046 | LM-SRPQ: Efficiently Answering Regular Path Query in Streaming Graphs | 2024 | VLDB |
| 3 | 1,575 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS |
| 4 | 4,981 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS |
| 5 | 1,658 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB |
| 6 | 2,209 | Regular Path Query Evaluation on Streaming Graphs | 2020 | SIGMOD |
| 7 | 11,133 | Distinct Shortest Walk Enumeration for RPQs | 2024 | PODS |
| 8 | 3,473 | Efficiently Answering Regular Simple Path Queries on Large Labeled Networks | 2019 | SIGMOD |
| 9 | 4,986 | Querying Graph Patterns | 2011 | PODS |
| 10 | 11,225 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB |