Output bounds for conjunctions of path queries

DOI10.1016/J.IPL.2026.106628MaRDI QIDQ7227493zbMATH OpenFDO

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

Publication date 10 April 2026

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IPL.2026.106628

zbMATH Keywords

conjunctive regular queriesgraph databasesregular queriesworst-case optimal algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A Researcher's Digest of GQL (invited talk)
• Navigational and rule-based languages for graph databases
• Regular queries on graph databases
• Size and treewidth bounds for conjunctive queries
• Size bounds and algorithms for conjunctive regular path queries
• Size bounds and query plans for relational joins

This page was built for publication: Output bounds for conjunctions of path queries

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