XPath query satisfiability is in PTIME for real-world DTDs

Montazerian, M. and Wood, Peter and Mousavi, S.R. (2007) XPath query satisfiability is in PTIME for real-world DTDs. In: Barbosa, D. and Bonifati, A. and Bellahsene, Z. and Hunt, E. and Unland, R. (eds.) XSym 2007: Database and XMLTechnologies, 5th International XML Database Symposium. Lecture Notes in Computer Science 4704. Springer, pp. 17-30. ISBN 9783540752875.

Full text not available from this repository.

Official URL: https://doi.org/10.1007/978-3-540-75288-2\_3

Abstract

The problem of XPath query satisfiability under DTDs (Document Type Definitions) is to decide, given an XPath query p and a DTD D, whether or not there is some document valid with respect to D on which p returns a nonempty result. Recent studies in the literature have shown the problem to be NP-hard or worse for most fragments of XPath. However, in this paper we show that the satisfiability problem is in PTIME for most DTDs used in real-world applications. Firstly, we report on the details of our investigation of real-world DTDs and define two properties that they typically satisfy: being duplicate-free and being covering. Then we concentrate on the satisfiability problem of XPath queries under such DTDs. We obtain a number of XPath fragments for which the complexity of the satisfiablity problem reduces to PTIME when such real-world DTDs are used.

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:	11 Oct 2021 18:28
Last Modified:	09 Aug 2023 12:52
URI:	https://eprints.bbk.ac.uk/id/eprint/46272

Statistics

Archive Staff Only (login required)

Edit/View Item