Size bounds and algorithms for conjunctive regular path queries

DOI10.4230/LIPICS.ICDT.2023.13MaRDI QIDQ6615187zbMATH OpenFDO

Authors Tamara Cucumides, Juan L. Reutter, Domajoj Vrgoč

Publication date 8 October 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2023.13

zbMATH Keywords

graph databasesregular path queriesworst-case optimal algorithms

Mathematics Subject Classification ID

Database theory (68P15)

Cited in

(2)

• Output bounds for conjunctions of path queries
• Answering path queries under linear and guarded existential rules

This page was built for publication: Size bounds and algorithms for conjunctive regular path queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615187)