On the complexity of tree pattern containment with arithmetic comparisons

Authors:
Foto N. Afrati;Sara Cohen;Gabriel Kuper
Affiliations:
Department of Electrical and Computing Engineering, National Technical University of Athens (NTUA), 15773 Athens, Greece;Department of Computer Science and Engineering, Hebrew University of Jerusalem, Jerusalem, Israel;Dipartimento di Ingegneria e Scienza dellInformazione Via Sommarive, 14 I-38123 Povo, Trento, Italy
Venue:
Information Processing Letters
Year:
2011

Citing 14
Cited 0

On conjunctive queries containing inequalities

Journal of the ACM (JACM)
Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
The complexity of querying indefinite data about linearly ordered domains

Journal of Computer and System Sciences - Special issue: dedicated to the memory of Paris Kanellakis
Containment for XPath Fragments under DTD Constraints

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Containment and equivalence for a fragment of XPath

Journal of the ACM (JACM)
XML Queries and constraints, containment and reformulation

Theoretical Computer Science - Database theory
Rewriting queries using views in the presence of arithmetic comparisons

Theoretical Computer Science
XPath satisfiability in the presence of DTDs

Journal of the ACM (JACM)
Revisiting redundancy and minimization in an XPath fragment

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Optimizing Conjunctive Queries over Trees Using Schema Information

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Complexity of Data Tree Patterns over XML Documents

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Satisfiability of downward XPath with data equality tests

Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of query containment in expressive fragments of XPath 2.0

Journal of the ACM (JACM)
Forward-XPath and extended register automata on data-trees

Proceedings of the 13th International Conference on Database Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper we investigate the complexity of query containment problem for tree patterns (which express a fragment of XPath) with arbitrary arithmetic comparisons. We assume that attributes take values from a totally ordered domain and allow constraints that involve arithmetic comparisons. We show that the containment problem is @P"2^P-complete in the general case, but remains co-NP complete for tree patterns with left semi-interval (, =, =) attribute constraints.