Conjunctive queries over trees

DOI10.1145/1131342.1131345zbMath1326.68110OpenAlexW2063039776WikidataQ59259658 ScholiaQ59259658MaRDI QIDQ3546316

Georg Gottlob, Christoph Koch, Klaus U. Schulz

Publication date: 21 December 2008

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://infoscience.epfl.ch/record/166880/files/56-pods2004_159.pdf

zbMATH Keywords

XMLcomplexitytreesexpressivenessconjunctive queriessuccinctness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Logic in computer science (03B70) Data structures (68P05)

Related Items (15)

Certain answers over incomplete XML documents: extending tractability boundary ⋮ Some modal aspects of XPath ⋮ Dominance constraints in stratified context unification ⋮ Querying Regular Graph Patterns ⋮ XML Schema Mappings ⋮ Automata for XML -- a survey ⋮ Solutions in XML data exchange ⋮ Conjunctive query containment over trees using schema information ⋮ Many Facets of Dualities ⋮ Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism ⋮ Data complexity of query answering in expressive description logics via tableaux ⋮ Conjunctive query containment over trees ⋮ Tractable XML data exchange via relations ⋮ Querying linguistic trees ⋮ Complexity of Data Tree Patterns over XML Documents

This page was built for publication: Conjunctive queries over trees