Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/610
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | NEVEN, Frank | - |
dc.contributor.author | Schwentick, Thomas | - |
dc.date.accessioned | 2005-03-08T14:26:16Z | - |
dc.date.available | 2005-03-08T14:26:16Z | - |
dc.date.issued | 2003 | - |
dc.identifier.citation | DATABASE THEORY ICDT 2003, PROCEEDINGS. p. 315-329 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/1942/610 | - |
dc.description.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. | - |
dc.format.extent | 308279 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER | - |
dc.relation.ispartofseries | LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.title | XPath containment in the presence of disjunction, DTDs, and variables. | - |
dc.type | Journal Contribution | - |
local.bibliographicCitation.conferencename | DATABASE THEORY ICDT 2003, PROCEEDINGS | - |
dc.identifier.epage | 329 | - |
dc.identifier.spage | 315 | - |
local.bibliographicCitation.jcat | A1 | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
local.relation.ispartofseriesnr | 2572 | - |
dc.bibliographicCitation.oldjcat | A1 | - |
dc.identifier.isi | 000181548600021 | - |
dc.identifier.url | http://portal.acm.org/citation.cfm?id=645505.756490&coll=GUIDE&dl=GUIDE | - |
item.accessRights | Open Access | - |
item.contributor | NEVEN, Frank | - |
item.contributor | Schwentick, Thomas | - |
item.fulltext | With Fulltext | - |
item.fullcitation | NEVEN, Frank & Schwentick, Thomas (2003) XPath containment in the presence of disjunction, DTDs, and variables.. In: DATABASE THEORY ICDT 2003, PROCEEDINGS. p. 315-329. | - |
item.validation | ecoom 2004 | - |
crisitem.journal.issn | 0302-9743 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
31 xpath.pdf | 301.05 kB | Adobe PDF | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.