Containment for XPath Fragments under DTD Constraints (2003)
| Venue: | In ICDT |
| Citations: | 59 - 1 self |
BibTeX
@INPROCEEDINGS{Wood03containmentfor,
author = {Peter T. Wood},
title = {Containment for XPath Fragments under DTD Constraints},
booktitle = {In ICDT},
year = {2003},
pages = {300--314}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The containment and equivalence problems for various fragments of XPath have been studied by a number of authors. For some fragments, deciding containment (and even minimisation) has been shown to be in ptime, while for minor extensions containment has been shown to be conp-complete. When containment is with respect to trees satisfying a set of constraints (such as a schema or DTD), the problem seems to be more difficult. For example, containment under DTDs is conp- complete for an XPath fragment denoted XP for which containment is in ptime. It is also undecidable for a larger class of XPath queries when the constraints are so-called simple XPath integrity constraints (SXICs).
