Computer Science – Databases
Scientific paper
2006-02-02
Computer Science
Databases
36 pages, 12 figures, 2 tables, long version of PODS 2004 papers. To appear in Journal of the ACM 53(2), March 2006
Scientific paper
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.
Gottlob Georg
Koch Christoph
Schulz Klaus U.
No associations
LandOfFree
Conjunctive Queries over Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Conjunctive Queries over Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Conjunctive Queries over Trees will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-484550