www.uhasselt.be
DSpace

Document Server@UHasselt >
Research >
All items >

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
Citation: DATABASE THEORY ICDT 2003, PROCEEDINGS. p. 315-329
Series/Report: LECTURE NOTES IN COMPUTER SCIENCE, 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.
URI: http://hdl.handle.net/1942/610
Link to publication: http://portal.acm.org/citation.cfm?id=645505.756490&coll=GUIDE&dl=GUIDE
ISI #: 000181548600021
ISSN: 0302-9743
Category: A1
Type: Journal Contribution
Validation: ecoom, 2004
Appears in Collections: Databases and Theoretical Computer Science

Files in This Item:

Description SizeFormat
View/OpenN/A301.05 kBAdobe PDF

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