Abstract
The satisfiability test of queries can be used in query optimization for avoiding submission and computation of unsatisfiable queries. Thus, applying the satisfiability test before executing a query can save evaluation time and transportation costs in distributed scenarios. Therefore, we propose a schema-based approach to the satisfiability test of XPath queries, which checks whether or not an XPath query conforms to the constraints in a given schema. If an XPath query does not conform to the constraints given in the schema, the evaluation of the query will return an empty result for every XML document. Thus, the XPath query is unsatisfiable. We present a complexity analysis of our approach, which proves that our approach is efficient at typical cases. We present an experimental analysis of our developed prototype, which shows the optimization potential of avoiding the evaluation of unsatisfiable queries.
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
Benedikt, M., Fan, W., Geerts, F.: XPath Satisfiability in the presence of DTDs. In: PODS 2005 (2005)
Franceschet, M.: XPathMark – An XPath benchmark for XMark. Research report PP-2005-04, University of Amsterdam, the Netherlands (2005)
Groppe, S.: XML Query Reformulation for XPath, XSLT and XQuery. Sierke-Verlag, Göttingen (2005)
Groppe, J., Groppe, S.: Filtering Unsatisfiabile XPath Queries. In: ICEIS 2006, Paphos-Cyprus (2006)
Groppe, S., Böttcher, S., Groppe, J.: XPath Query Simplification with regard to the Elimination of Intersect and Except Operators. In: XSDM 2006 in association with ICDE 2006 (2006)
Hidders, J.: Satisfiability of xPath expressions. In: Lausen, G., Suciu, D. (eds.) DBPL 2003. LNCS, vol. 2921, pp. 21–36. Springer, Heidelberg (2004)
Kwong, A., Gertz, M.: Schema-based optimization of XPath expressions. Techn. Report University of California (2002)
Lakshmanan, L., Ramesh, G., Wang, H., Zhao, Z.: On Testing Satisfiability of Tree Pattern Queries. In: VLDB 2004 (2004)
Olteanu, D., Meuss, H., Furche, T., Bry, F.: XPath: Looking forward. In: Chaudhri, A.B., Unland, R., Djeraba, C., Lindner, W. (eds.) EDBT 2002, vol. 2490, pp. 109–127. Springer, Heidelberg (2002)
Schmidt, D.A.: The structure of Typed programming languages. MIT Press, Cambridge (1994)
Wadler, P.: Two semantics for XPath. Tech. Report (2000)
W3C: XML Schema Part 1: Structures Second Edition. W3C Recommendation (2004), http://www.w3.org/TR/xmlschema-1
W3C: XPath Version 1.0, W3C Recommendation (1999), http://www.w3.org/TR/xpath/
W3C: XPath Version 2.0, W3C Working Draft (2003), http://www.w3.org/TR/xpath20/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Groppe, J., Groppe, S. (2006). A Prototype of a Schema-Based XPath Satisfiability Tester. In: Bressan, S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2006. Lecture Notes in Computer Science, vol 4080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11827405_10
Download citation
DOI: https://doi.org/10.1007/11827405_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37871-6
Online ISBN: 978-3-540-37872-3
eBook Packages: Computer ScienceComputer Science (R0)