Conjunctive query containment over trees

Authors:
Henrik Björklund;Wim Martens;Thomas Schwentick
Affiliations:
Technical University of Dortmund, Germany;Technical University of Dortmund, Germany;Technical University of Dortmund, Germany
Venue:
Journal of Computer and System Sciences
Year:
2011

Citing 11
Cited 3

Containment and Optimization of Object-Preserving Conjunctive Queries

SIAM Journal on Computing
Conjunctive-query containment and constraint satisfaction

Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Containment and equivalence for a fragment of XPath

Journal of the ACM (JACM)
The complexity of XPath query evaluation and XML typing

Journal of the ACM (JACM)
Conjunctive queries over trees

Journal of the ACM (JACM)
On deciding well-definedness for query languages on trees

Journal of the ACM (JACM)
The complexity of query containment in expressive fragments of XPath 2.0

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML data exchange: Consistency and query answering

Journal of the ACM (JACM)
Optimizing Conjunctive Queries over Trees Using Schema Information

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Conjunctive query containment over trees

DBPL'07 Proceedings of the 11th international conference on Database programming languages

On the complexity of query answering over incomplete XML documents

Proceedings of the 15th International Conference on Database Theory
Containment of pattern-based queries over data trees

Proceedings of the 16th International Conference on Database Theory
Reasoning about pattern-based XML queries

RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

The complexity of containment and satisfiability of conjunctive queries over finite, unranked, labeled trees is studied with respect to the axes Child, NextSibling, their transitive and reflexive closures, and Following. For the containment problem a trichotomy is presented, classifying the problems as in PTIME, coNP-complete, or @P"2^P-complete. For the satisfiability problem most problems are classified as either in PTIME or NP-complete.