Abstract
XPath satisfiability is one of the most basic problems of XML query optimization. A satisfiability decision framework, named SAT − DTD, is proposed to determine, given a set of XPath queries P and a DTD τ , which subset of P are satisfiable by an XML tree conforming to DTD τ. In the framework, an indexed NFA is constructed from the set of XPath queries P, and then the NFA is driven by simple API for DTD (SAD, something like SAX) events, derived from DTD τ, to evaluate the predicates in P and to decide the satisfiability of P. Especially, DTD choice (i.e. ’|’ operator) is taken into consideration, and an algorithm, named SAT − DTD_C, which bases on SAT − DTD, is put forward to determine the unsatisfiability caused by DTD choice. At last, the complexity of the algorithms is analyzed, and the correctness of the algorithms is tested by experiments.
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
Clark, J., DeRose, S.: XPath Version 1.0. W3C Recommendation (1999), http://www.w3.org/TR/xpath
Miklau, G., Suciu, D.: Containment and equivalence for a fragment of XPath. Journal of the ACM 51(1), 2–45 (2004)
Wood, P.: Containment of XPath Fragments under DTD Constraints. In: Proceedings of Int. Conference on Database Theory (2003)
Böttcher, S., Steinmetz, R.: A DTD Graph Based XPath Query Subsumption Test. In: Proceedings of XML Database Symposium at VLDB, Berlin, Germany (2003)
Liao, Y., Feng, J., Zhang, Y., Zhou, L.: Hidden Conditioned Homomorphism for XPath Fragment Containment. In: Li Lee, M., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 454–467. Springer, Heidelberg (2006)
Yoo, S., Son, J.H., Kim, M.H.: Maintaining Homomorphism Information of XPath Patterns. In: IASTED-DBA, pp. 192–197 (2005)
Fu, M., Zhang, Y.: Homomorphism Resolving of XPath Trees Based on Automata. In: Dong, G., Lin, X., Wang, W., Yang, Y., Yu, J.X. (eds.) APWeb/WAIM 2007. LNCS, vol. 4505, pp. 821–828. Springer, Heidelberg (2007)
Benedikt, M., Fan, W., Geerts, F.: XPath Satisfiability in the Presence of DTDs. In: Proceedings of the 24th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 25–36 (2005)
Diao, Y., Altinel, M., Franklin, M.J., et al.: Path Sharing and Predicate Evaluation for High-Performance XML Filtering. ACM TODS 28(4), 467–516 (2003)
Hidders, J.: Satisfiability of XPath expressions. In: Proceedings of the 9th International Workshop on Database Programming Languages, pp. 21–36 (2003)
Lakshmanan, L., Ramesh, G., Wang, H., et al.: On testing astisfiablity of the tree pattern queries. In: VLDB (2004)
Marx, M.: XPath with conditional axis relations. In: EDBT (2004)
Geerts, F., Fan, W.: Satisfiability of XPath Queries with Sibling Axis. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, pp. 122–137. Springer, Heidelberg (2005)
Xerces2 Java Parser 2.6.0., http://xerces.apache.org/xerces2-j/
Zhang, Y., Wu, N.: XSIEQ - An XML Stream Query System with immediate Evaluation. Mini-Micro Systems 27(8), 1514–1518 (2006)
Sax Project Organization, SAX: Simple API for XML. (2001), http://www.saxproject.org
Schmidt, A., Waas, F., et al.: A Benchmark for XML Data Management. In: Proceedings of the 28th VLDB Conference, Hongkong, China (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Y., Cao, Y., Li, X. (2008). A Decision Procedure for XPath Satisfiability in the Presence of DTD Containing Choice. In: Zhang, Y., Yu, G., Bertino, E., Xu, G. (eds) Progress in WWW Research and Development. APWeb 2008. Lecture Notes in Computer Science, vol 4976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78849-2_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-78849-2_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78848-5
Online ISBN: 978-3-540-78849-2
eBook Packages: Computer ScienceComputer Science (R0)