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 |
|---|---|---|---|---|
| 657 | An Analytical Study of Large SPARQL Query Logs | 2018 | VLDB | 0.00018581389 |
| 2,832 | Regular Path Query Evaluation on Streaming Graphs | 2020 | SIGMOD | 8.048358e-05 |
| 4,191 | Efficiently Answering Regular Simple Path Queries on Large Labeled Networks | 2019 | SIGMOD | 6.3676619e-05 |
| 5,527 | Representing Paths in Graph Database Pattern Matching | 2023 | VLDB | 5.4573655e-05 |
| 8,827 | The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs | 2022 | PODS | 4.4369334e-05 |
| 8,947 | Towards Theory for Real-World Data | 2022 | PODS | 4.4216375e-05 |
| 11,017 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB | 4.1905499e-05 |
| 11,082 | Complex-Path: Effective and Efficient Node Ranking with Paths in Billion-Scale Heterogeneous Graphs | 2024 | VLDB | 4.1905499e-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 |
|---|---|---|---|---|
| 276 | Regular Path Queries with Constraints | 1997 | PODS | 0.00029365217 |
| 364 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00025657601 |
| 2,958 | Computing Label-Constraint Reachability in Graph Databases | 2010 | SIGMOD | 7.8126329e-05 |
| 3,659 | The Complexity of Evaluating Path Expressions in SPARQL | 2012 | PODS | 6.8684407e-05 |
| 4,949 | Querying Graph Patterns | 2011 | PODS | 5.8090034e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,916 | Distinct Shortest Walk Enumeration for RPQs | 2024 | PODS | 4.1905499e-05 |
| 3,659 | The Complexity of Evaluating Path Expressions in SPARQL | 2012 | PODS | 6.8684407e-05 |
| 10,367 | Resilience for Regular Path Queries: Towards a Complexity Classification | 2025 | PODS | 4.1905499e-05 |
| 11,907 | Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? | 2015 | PODS | 4.1905499e-05 |
| 9,743 | Output-Sensitive Evaluation of Regular Path Queries | 2025 | PODS | 4.2856385e-05 |
| 4,949 | Querying Graph Patterns | 2011 | PODS | 5.8090034e-05 |
| 1,812 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS | 0.00010458164 |
| 11,017 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB | 4.1905499e-05 |
| 1,445 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB | 0.00011937596 |
| 8,827 | The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs | 2022 | PODS | 4.4369334e-05 |