We consider Boolean combinations of data tree patterns as a specification and query language for XML documents. Data tree patterns are tree patterns plus variable (in)equalities which express joins between attribute values. Data tree patterns are a simple and natural formalism for expressing properties of XML documents. We consider first the model checking problem (query evaluation), we show that it is DP-complete in general and already NP-complete when we consider a single pattern. We then consider the satisfiability problem in the presence of a DTD. We show that it is in general undecidable and we identify several decidable fragments. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
David, C. (2008). Complexity of data tree patterns over XML documents. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5162 LNCS, pp. 278–289). https://doi.org/10.1007/978-3-540-85238-4_22
Mendeley helps you to discover research relevant for your work.