Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries

Authors

• 1. Mahmoud Abo Khamis (RelationalAI)
• 2. Alexandru-Mihai Hurjui (University of Zurich)
• 3. Ahmet Kara (Ostbayerische Technische Hochschule Regensburg)
• 4. Dan Olteanu (University of Zurich)
• 5. Dan Suciu (University of Washington)

@inproceedings{khamis_pods26,
        address = {New York, NY, USA},
        series = {{PODS} '26},
        title = {{Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries}},
        url = {https://dl.acm.org/doi/10.1145/3801891},
        doi = {10.1145/3801891},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Khamis, Mahmoud Abo and Hurjui, Alexandru-Mihai and Kara, Ahmet and Olteanu, Dan and Suciu, Dan},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Semantically Similar Papers