On the complexity of tree pattern containment with arithmetic comparisons

Foto N. Afrati; Sara Cohen; Gabriel Kuper

doi:10.1016/j.ipl.2011.04.014

On the complexity of tree pattern containment with arithmetic comparisons

Foto N. Afrati, Sara Cohen, Gabriel Kuper

The Rachel and Selim Benin School of Engineering and Computer Science

The Hebrew University of Jerusalem

Research output: Contribution to journal › Article › peer-review

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 Π2P-complete in the general case, but remains co-NP complete for tree patterns with left semi-interval (<, ≤, =) or right semi-interval (>, ≥, =) attribute constraints.

Original language	English
Pages (from-to)	754-760
Number of pages	7
Journal	Information Processing Letters
Volume	111
Issue number	15
DOIs	https://doi.org/10.1016/j.ipl.2011.04.014
State	Published - 15 Aug 2011

Keywords

Arithmetic comparisons
Databases
Query containment
Tree patterns
XPath queries

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2011.04.014

Cite this

@article{560780fe01a644da94f76eedd1df227f,

title = "On the complexity of tree pattern containment with arithmetic comparisons",

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 Π2P-complete in the general case, but remains co-NP complete for tree patterns with left semi-interval (<, ≤, =) or right semi-interval (>, ≥, =) attribute constraints.",

keywords = "Arithmetic comparisons, Databases, Query containment, Tree patterns, XPath queries",

author = "Afrati, {Foto N.} and Sara Cohen and Gabriel Kuper",

note = "Funding Information: E-mail addresses: [email protected] (F.N. Afrati), [email protected] (S. Cohen), [email protected] (G. Kuper). 1 Sara Cohen was partially supported by the Israel Science Foundation (Grant 143/09).",

year = "2011",

month = aug,

day = "15",

doi = "10.1016/j.ipl.2011.04.014",

language = "الإنجليزيّة",

volume = "111",

pages = "754--760",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "15",

}

TY - JOUR

T1 - On the complexity of tree pattern containment with arithmetic comparisons

AU - Afrati, Foto N.

AU - Cohen, Sara

AU - Kuper, Gabriel

N1 - Funding Information: E-mail addresses: [email protected] (F.N. Afrati), [email protected] (S. Cohen), [email protected] (G. Kuper). 1 Sara Cohen was partially supported by the Israel Science Foundation (Grant 143/09).

PY - 2011/8/15

Y1 - 2011/8/15

N2 - 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 Π2P-complete in the general case, but remains co-NP complete for tree patterns with left semi-interval (<, ≤, =) or right semi-interval (>, ≥, =) attribute constraints.

AB - 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 Π2P-complete in the general case, but remains co-NP complete for tree patterns with left semi-interval (<, ≤, =) or right semi-interval (>, ≥, =) attribute constraints.

KW - Arithmetic comparisons

KW - Databases

KW - Query containment

KW - Tree patterns

KW - XPath queries

UR - http://www.scopus.com/inward/record.url?scp=80955174595&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2011.04.014

DO - 10.1016/j.ipl.2011.04.014

M3 - مقالة

SN - 0020-0190

VL - 111

SP - 754

EP - 760

JO - Information Processing Letters

JF - Information Processing Letters

IS - 15

ER -

On the complexity of tree pattern containment with arithmetic comparisons

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this