Informatics Report Series



Related Pages

Report (by Number) Index
Report (by Date) Index
Author Index
Institute Index

Title:XPath Satisfiability in the Presence of DTDs
Authors: Michael Benedikt ; Wenfei Fan ; Floris Geerts
Date:6 2005
Publication Title:Proceedings of PODS 2005 (Symposium on Principles of Database Systems)
Publication Type:Conference Paper Publication Status:Published
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or not there exists an XML document T such that T conforms to D and the answer of p on T is nonempty. We consider a variety of XPath fragments widely used in practice, and investigate the impact of different XPath operators on satisfiability analysis. We first study the problem for negation-free XPath fragments with and without upward axes, recursion and data-value joins, identifying which factors lead to tractability and which to NP-completeness. We then turn to fragments with negation but without data values, establishing lower and upper bounds in the absence and in the presence of upward modalities and recursion. We show that with negation the complexity ranges from PSPACE to EXPTIME. Moreover, when both data values and negation are in place, we find that the complexity ranges from NEXPTIME to undecidable. Finally, we give a finer analysis of the problem for particular classes of DTDs, exploring the impact of various DTD constructs, identifying tractable cases, as well as providing the complexity in the query size alone.
Links To Paper
1st Link
2nd Link
Bibtex format
author = { Michael Benedikt and Wenfei Fan and Floris Geerts },
title = {XPath Satisfiability in the Presence of DTDs},
book title = {Proceedings of PODS 2005 (Symposium on Principles of Database Systems)},
publisher = {PODS},
year = 2005,
month = {6},
url = {},

Home : Publications : Report 

Please mail <> with any changes or corrections.
Unless explicitly stated otherwise, all material is copyright The University of Edinburgh