Optimizing Conjunctive Queries over Trees Using Schema Information

DOI10.1007/978-3-540-85238-4_10zbMath1173.68473OpenAlexW1516630410MaRDI QIDQ3599121

Thomas Schwentick, Wim Martens, Henrik Björklund

Publication date: 3 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85238-4_10

Mathematics Subject Classification ID

Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (9)

Containment of Monadic Datalog Programs via Bounded Clique-Width ⋮ Future-Looking Logics on Data Words and Trees ⋮ XML Schema Mappings ⋮ Solutions in XML data exchange ⋮ Eliminating Recursion from Monadic Datalog Programs on Trees ⋮ On the complexity of tree pattern containment with arithmetic comparisons ⋮ Extending two-variable logic on data trees with order on data values and its automata ⋮ Conjunctive query containment over trees ⋮ Complexity of Data Tree Patterns over XML Documents

This page was built for publication: Optimizing Conjunctive Queries over Trees Using Schema Information