Conjunctive Queries over Trees
| dc.creator | Gottlob, Georg | |
| dc.creator | Koch, Christoph | |
| dc.creator | Schulz, Klaus U. | |
| dc.date | 2006-02-02 | |
| dc.date.accessioned | 2026-07-07T07:02:28Z | |
| dc.date.available | 2026-07-07T07:02:28Z | |
| dc.description | We study the complexity and expressive power of conjunctive queries over unranked labeled trees represented using a variety of structure relations such as ``child'', ``descendant'', and ``following'' as well as unary relations for node labels. 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 and establish a dichotomy theorem for our axis relations, i.e., we find all subset-maximal sets of axes for which query evaluation is in polynomial time and show that for all other cases, query evaluation is NP-complete. 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 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. | |
| dc.description | 36 pages, 12 figures, 2 tables, long version of PODS 2004 papers. To appear in Journal of the ACM 53(2), March 2006 | |
| dc.identifier | https://arxiv.org/abs/cs/0602004 | |
| dc.identifier | http://arxiv.org/abs/cs/0602004 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/108608 | |
| dc.subject | Databases | |
| dc.subject | Artificial Intelligence | |
| dc.subject | Computational Complexity | |
| dc.subject | Logic in Computer Science | |
| dc.subject | E.1; F.1.3; F.2.2; H.2.3; H.2.4; I.7.2 | |
| dc.title | Conjunctive Queries over Trees | |
| dc.type | text |