Wood, Peter (2003) Containment for XPath fragments under DTD constraints. In: Calvanese, D. and Lenzerini, M. and Motwani, R. (eds.) ICDT 2003: Database Theory. Lecture Notes in Computer Science 2572. Springer, pp. 297-311. ISBN 9783540003236.
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). In this paper, we show that containment is decidable for an important fragment of XPath, denoted XP{[ ],*,//}, when the constraints are DTDs. We also identify XPath fragments for which containment under DTDs can be decided in PTIME.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 18 Oct 2021 14:16 |
| Last Modified: | 09 Aug 2023 12:52 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/46322 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
