A Trichotomy for Regular Simple Path Queries on Graphs
Summary: Complete classification of regular languages for regular simple path queries: data complexity is exactly AC0, NL-complete, or NP-complete. Identifies a simple regex fragment for tractability; membership testing is NL-complete for DFAs and PSPACE-complete for NFAs/regexes, with results extended to vertex-labeled graphs. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Guillaume Bagan
- 2. Angela Bonifati
- 3. Benoit Groz
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 690 | An Analytical Study of Large SPARQL Query Logs | 2018 | VLDB | 0.00018099792 |
| 2,826 | Regular Path Query Evaluation on Streaming Graphs | 2020 | SIGMOD | 8.056119e-05 |
| 4,191 | Efficiently Answering Regular Simple Path Queries on Large Labeled Networks | 2019 | SIGMOD | 6.3735885e-05 |
| 5,517 | Representing Paths in Graph Database Pattern Matching | 2023 | VLDB | 5.4626107e-05 |
| 8,827 | The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs | 2022 | PODS | 4.4411907e-05 |
| 8,943 | Towards Theory for Real-World Data | 2022 | PODS | 4.4258797e-05 |
| 11,014 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB | 4.1945683e-05 |
| 11,079 | Complex-Path: Effective and Efficient Node Ranking with Paths in Billion-Scale Heterogeneous Graphs | 2024 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 274 | Regular Path Queries with Constraints | 1997 | PODS | 0.00029390022 |
| 363 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00025715157 |
| 2,957 | Computing Label-Constraint Reachability in Graph Databases | 2010 | SIGMOD | 7.8198686e-05 |
| 3,652 | The Complexity of Evaluating Path Expressions in SPARQL | 2012 | PODS | 6.875313e-05 |
| 4,946 | Querying Graph Patterns | 2011 | PODS | 5.8149362e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,912 | Distinct Shortest Walk Enumeration for RPQs | 2024 | PODS | 4.1945683e-05 |
| 3,652 | The Complexity of Evaluating Path Expressions in SPARQL | 2012 | PODS | 6.875313e-05 |
| 10,355 | Resilience for Regular Path Queries: Towards a Complexity Classification | 2025 | PODS | 4.1945683e-05 |
| 9,744 | Output-Sensitive Evaluation of Regular Path Queries | 2025 | PODS | 4.2897489e-05 |
| 11,899 | Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? | 2015 | PODS | 4.1945683e-05 |
| 4,946 | Querying Graph Patterns | 2011 | PODS | 5.8149362e-05 |
| 1,812 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS | 0.00010467069 |
| 11,014 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB | 4.1945683e-05 |
| 1,444 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB | 0.00011946075 |
| 8,827 | The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs | 2022 | PODS | 4.4411907e-05 |