Between Tree Patterns and Conjunctive Queries: Is There Tractability beyond Acyclicity?
From MaRDI portal
Publication:2912769
DOI10.1007/978-3-642-32589-2_61zbMath1365.68215OpenAlexW116502645MaRDI QIDQ2912769
Filip Murlak, Marcin Przybyłko, Michał Ogiński
Publication date: 25 September 2012
Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_61
Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Conjunctive query containment over trees using schema information ⋮ Unnamed Item ⋮ The uniform measure of simple regular sets of infinite trees
This page was built for publication: Between Tree Patterns and Conjunctive Queries: Is There Tractability beyond Acyclicity?
