Minimizing Conjunctive Regular Path Queries
Summary: Minimization of CRPQs and UCRPQs is decidable; CRPQ minimization has a 2ExpSpace upper bound (brute-force) and ExpSpace lower bound. UCRPQ minimization is ExpSpace-complete (matching containment); for simple-REs it becomes Pi_p^2-complete, with upper bound via maximal under-approximation. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Diego Figueira (Bordeaux Institute of Technology; CNRS; University of Bordeaux)
- 2. Rémi Morvan (Bordeaux Institute of Technology; CNRS; University of Bordeaux)
- 3. Miguel Romero (CENIA; Pontifical Catholic University of Chile)
BibTeX Citation
@inproceedings{figueira_pods25,
address = {New York, NY, USA},
series = {{PODS} '25},
title = {{Minimizing Conjunctive Regular Path Queries}},
url = {https://dl.acm.org/doi/10.1145/3725237},
doi = {10.1145/3725237},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Figueira, Diego and Morvan, Rémi and Romero, Miguel},
year = {2025}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,146 | Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries | 2026 | PODS | 5.093636e-05 |
| 10,167 | A Logical View of GNN-Style Computation and the Role of Activation Functions | 2026 | PODS | 5.093636e-05 |
| 10,215 | cuRPQ: A High-Performance GPU-Based Framework for Processing Regular and Conjunctive Regular Path Queries | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 686 | Query Containment for Conjunctive Queries With Regular Expressions | 1998 | PODS | 0.00014948634 |
| 5,425 | GPC: A Pattern Calculus for Property Graphs | 2023 | PODS | 6.223218e-05 |
| 7,205 | Containment of Graph Queries Modulo Schema | 2024 | PODS | 5.6731473e-05 |
| 8,190 | Conjunctive Regular Path Queries under Injective Semantics | 2023 | PODS | 5.4700577e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 12,165 | Does Query Evaluation Tractability Help Query Containment? | 2014 | PODS |
| 2 | 1,528 | Joining Extractions of Regular Expressions | 2018 | PODS |
| 3 | 7,487 | When is the Evaluation of Extended CRPQ Tractable? | 2022 | PODS |
| 4 | 5,146 | Query Containment and Rewriting Using Views for Regular Path Queries Under Constraints | 2003 | PODS |
| 5 | 686 | Query Containment for Conjunctive Queries With Regular Expressions | 1998 | PODS |
| 6 | 7,289 | Conjunctive Regular Path Queries with String Variables | 2020 | PODS |
| 7 | 1,575 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS |
| 8 | 1,630 | On the Decidability of Query Containment under Constraints | 1998 | PODS |
| 9 | 10,146 | Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries | 2026 | PODS |
| 10 | 8,190 | Conjunctive Regular Path Queries under Injective Semantics | 2023 | PODS |