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
No non-self incoming citations found for this paper in this database.
Authors
- 1. Diego Figueira
- 2. Rémi Morvan
- 3. Miguel Romero
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 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 |
|---|---|---|---|---|
| 810 | Query Containment for Conjunctive Queries With Regular Expressions | 1998 | PODS | 0.00016428374 |
| 5,651 | GPC: A Pattern Calculus for Property Graphs | 2023 | PODS | 5.3905536e-05 |
| 6,896 | Containment of Graph Queries Modulo Schema | 2024 | PODS | 4.8925595e-05 |
| 8,804 | Conjunctive Regular Path Queries under Injective Semantics | 2023 | PODS | 4.4468701e-05 |
Previous
Page 1 / 1
Next