Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/610
Title: XPath containment in the presence of disjunction, DTDs, and variables.
Authors: NEVEN, Frank 
Schwentick, Thomas
Issue Date: 2003
Publisher: SPRINGER
Source: DATABASE THEORY ICDT 2003, PROCEEDINGS. p. 315-329
Series/Report: LECTURE NOTES IN COMPUTER SCIENCE
Series/Report no.: 2572
Abstract: XPath is a simple language for navigating an XML tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various fragments of XPath. In addition to the basic operations (child, descendant, filter, and wildcard), we consider disjunction, DTDs and variables. W.r.t. variables we study two semantics: (1) the value of variables is given by an outer context; (2) the value of variables is defined existentially.We establish an almost complete classification of the complexity of the containment problem w.r.t. these fragments.
Document URI: http://hdl.handle.net/1942/610
Link to publication: http://portal.acm.org/citation.cfm?id=645505.756490&coll=GUIDE&dl=GUIDE
ISSN: 0302-9743
ISI #: 000181548600021
Category: A1
Type: Journal Contribution
Validations: ecoom 2004
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
31 xpath.pdf301.05 kBAdobe PDFView/Open
Show full item record

WEB OF SCIENCETM
Citations

43
checked on May 22, 2022

Page view(s)

110
checked on May 25, 2022

Download(s)

150
checked on May 25, 2022

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.