Conjunctive queries over trees
- 14 June 2004
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 189-200
- https://doi.org/10.1145/1055558.1055585
Abstract
We study the complexity and expressive power of conjunctive queries over unranked labeled trees, where the tree structure are represented using "axis relations" such as "child", "descendant", and "following" (we consider a superset of the XPath axes) as well as unary relations for node labels. (Cyclic) conjunctive queries over trees occur in a wide range of data management scenarios related to XML, the Web, and computational linguistics. We establish a framework for characterizing structures representing trees for which conjunctive queries can be evaluated efficiently. Then we completely chart the tractability frontier of the problem for our axis relations, i.e., we find all subset maximal sets of axes for which query evaluation is in polynomial time. All polynomial-time results are obtained immediately using the proof techniques from our framework. Finally, we study the expressiveness of conjunctive queries over trees and compare it to the expressive power of fragments of XPath. We show that for each conjunctive query, there is an equivalent acyclic positive query (i.e., a set of acyclic conjunctive queries), but that in general this query is not of polynomial size.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Monadic datalog and the expressive power of languages for Web information extractionJournal of the ACM, 2004
- The complexity of XPath query evaluationPublished by Association for Computing Machinery (ACM) ,2003
- Complete answer aggregates for treelike databasesACM Transactions on Information Systems, 2001
- LTUR: a simplified linear-time unit resolution algorithm for horn formulae and computer implementationInformation Processing Letters, 1988
- D-theoryPublished by Association for Computational Linguistics (ACL) ,1983
- The complexity of satisfiability problemsPublished by Association for Computing Machinery (ACM) ,1978
- Optimal implementation of conjunctive queries in relational data basesPublished by Association for Computing Machinery (ACM) ,1977