DBScholar

Back to papers

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)

Paper ID
2003
Venue
PODS
Year
2025
Pagerank
5.7951134e-05
Overall Rank
6,718 | 53.91%
DOI
10.1145/3725237

Incoming Non-self Citations Over Time

Authors

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.

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