On the complexity of tree pattern containment with arithmetic comparisons

Afrati, FN; Cohen, S; Kuper, G

dc.contributor.author	Afrati, FN	en
dc.contributor.author	Cohen, S	en
dc.contributor.author	Kuper, G	en
dc.date.accessioned	2014-03-01T01:36:33Z
dc.date.available	2014-03-01T01:36:33Z
dc.date.issued	2011	en
dc.identifier.issn	0020-0190	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/21333
dc.subject	Arithmetic comparisons	en
dc.subject	Databases	en
dc.subject	Query containment	en
dc.subject	Tree patterns	en
dc.subject	XPath queries	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.other	Arithmetic comparisons	en
dc.subject.other	Databases	en
dc.subject.other	Query containment	en
dc.subject.other	Tree patterns	en
dc.subject.other	XPath queries	en
dc.subject.other	Plant extracts	en
dc.title	On the complexity of tree pattern containment with arithmetic comparisons	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.ipl.2011.04.014	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.ipl.2011.04.014	en
heal.language	English	en
heal.publicationDate	2011	en
heal.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 Pi(P)(2)-complete in the general case, but remains co-NP complete for tree patterns with left semi-interval (<, <=, =) or right semi-interval (>, >=, =) attribute constraints. (C) 2011 Elsevier B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Information Processing Letters	en
dc.identifier.doi	10.1016/j.ipl.2011.04.014	en
dc.identifier.isi	ISI:000292659800007	en
dc.identifier.volume	111	en
dc.identifier.issue	15	en
dc.identifier.spage	754	en
dc.identifier.epage	760	en