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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amer-Yahia, S., Cho, S., Lakshmanan, L.V.S., Srivastava, D.: Tree pattern query minimization. The VLDB Journal 11, 315–331 (2002)
Benedikt, M., Fan, W., Geerts, F.: XPath satisfiability in the presence of DTDs. Proc. Twenty-fourth ACM Symp. on Principles of Databases Systems (2005) (to appear in J. ACM)
Bex, G.J., Neven, F., Van den Bussche, J.: DTDs versus XML schema: A practical study. In: Proc. Seventh Int. Workshop on the Web and Databases, pp. 79–84 (2004)
Choi, B.: What are real DTDs like? In: Proc. Fifth Int. Workshop on the Web and Databases, pp. 43–48 (2002)
Flesca, S., Furfaro, F., Masciari, E.: On the minimization of XPath queries. In: Proc. 29th Int. Conf. on Very Large Data Bases, pp. 153–164 (2003)
Geerts, F., Fan, W.: Satisfiability of XPath queries with sibling axes. In: Proc. 10th Int. Workshop on Database Programming Languages, pp. 122–137 (2005)
Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. ACM Trans. on Database Syst. 30(2), 444–491 (2005)
Hidders, J.: Satisfiability of XPath expressions. In: Proc. 9th Int. Workshop on Database Programming Languages (September 2003)
Lakshmanan, L., Ramesh, G., Wang, H., Zhao, Z.: On testing satisfiability of tree pattern queries. In: Proc. 30th Int. Conf. on Very Large Data Bases, pp. 120–131 (2004)
Miklau, G., Suciu, D.: Containment and equivalence for a fragment of XPath. J. ACM 51(1), 2–45 (2004)
Neven, F., Schwentick, T.: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in Computer Science 2(3) (2006)
Ramanan, P.: Efficient algorithms for minimizing tree pattern queries. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 299–309. ACM Press, New York (2002)
Wood, P.T.: Minimising simple XPath expressions. In: Proc. Fourth Int. Workshop on the Web and Databases, pp. 13–18 (2001)
Wood, P.T.: Containment for XPath fragments under DTD constraints. In: Proc. 9th Int. Conf. on Database Theory, pp. 300–314 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Montazerian, M., Wood, P.T., Mousavi, S.R. (2007). XPath Query Satisfiability is in PTIME for Real-World DTDs. In: Barbosa, D., Bonifati, A., Bellahsène, Z., Hunt, E., Unland, R. (eds) Database and XMLTechnologies. XSym 2007. Lecture Notes in Computer Science, vol 4704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75288-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-75288-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75287-5
Online ISBN: 978-3-540-75288-2
eBook Packages: Computer ScienceComputer Science (R0)