Answering Regular Path Queries through Exemplars
Summary: RQUBE infers RPQ regex from a user exemplar, enabling query-by-example for regular path queries on graphs. Scales to million-scale graphs via Biermann–Feldman and NFA-guided random walks with restarts, delivering about 3 orders of magnitude faster performance with >90% accuracy. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Komal Chauhan
- 2. Kartik Jain
- 3. Sayan Ranu
- 4. Srikanta Bedathur
- 5. Amitabha Bagchi
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 |
|---|---|---|---|---|
| 62 | Freebase: A Collaboratively Created Graph Database For Structuring Human Knowledge | 2008 | SIGMOD | 0.00064239035 |
| 964 | G-CORE: A Core for Future Graph Query Languages | 2018 | SIGMOD | 0.00014967208 |
| 2,832 | Regular Path Query Evaluation on Streaming Graphs | 2020 | SIGMOD | 8.048358e-05 |
| 2,958 | Computing Label-Constraint Reachability in Graph Databases | 2010 | SIGMOD | 7.8126329e-05 |
| 3,221 | Landmark Indexing for Evaluation of Label-Constrained Reachability Queries | 2017 | SIGMOD | 7.3541078e-05 |
| 4,191 | Efficiently Answering Regular Simple Path Queries on Large Labeled Networks | 2019 | SIGMOD | 6.3676619e-05 |
| 6,796 | Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond | 2020 | VLDB | 4.9195203e-05 |
| 8,209 | Mining Top-k Pairs of Correlated Subgraphs in a Large Network | 2020 | VLDB | 4.5537353e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,664 | Answering Why-questions by Exemplars in Attributed Graphs | 2019 | SIGMOD | 4.1905499e-05 |
| 8,172 | LM-SRPQ: Efficiently Answering Regular Path Query in Streaming Graphs | 2024 | VLDB | 4.5653572e-05 |
| 1,812 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS | 0.00010458164 |
| 5,435 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS | 5.5074113e-05 |
| 1,445 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB | 0.00011937596 |
| 2,832 | Regular Path Query Evaluation on Streaming Graphs | 2020 | SIGMOD | 8.048358e-05 |
| 10,916 | Distinct Shortest Walk Enumeration for RPQs | 2024 | PODS | 4.1905499e-05 |
| 4,191 | Efficiently Answering Regular Simple Path Queries on Large Labeled Networks | 2019 | SIGMOD | 6.3676619e-05 |
| 4,949 | Querying Graph Patterns | 2011 | PODS | 5.8090034e-05 |
| 11,017 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB | 4.1905499e-05 |