Structural Properties of XPath Fragments
We study structural properties of each of the main sublanguages of XPath  commonly used in practice. First, we characterize the expressive power of these language fragments in terms of both logics and tree patterns. Second, we investigate closure properties, focusing on the ability to perform basic Boolean operations while remaining within the fragment. We give a complete picture of the closure properties of these fragments, treating XPath expressions both as functions of arbitrary nodes in a document tree, and as functions that are applied only at the root of the tree. Finally, we provide sound and complete axiom systems and normal forms for several of these fragments. These results are useful for simplification of XPath expressions and optimization of XML queries.
KeywordsNormal Form Tree Pattern Expressive Power Axiom System Closure Property
Unable to display preview. Download preview PDF.
- 1.S. Amer-Yahia, S. Cho, V. Lakshmaman, and D. Srivistava. Minimization of tree pattern queries. In SIGMOD, 2001.Google Scholar
- 2.A. Berglund et al. XML Path Language (XPath) 2.0. W3C Working Draft, Dec. 2001. http://www.w3.org/TR/xpath20.
- 4.D. Calvanese, G. De Giacomo, M. Lenzerini, and D. Nardi. Reasoning in expressive description logics. In Handbook of Automated Reasoning, pages 1581–1634. Elsevier, 2001.Google Scholar
- 5.D. Chamberlin et al. XQuery 1.0: An XML query language. W3C Working Draft, June 2001. http://www.w3.org/TR/xquery.
- 6.C. Chan, P. Felber, M. Garofalakis, and R. Rastogu. Efficient filtering of XML documents with XPath expressions. In ICDE, 2002.Google Scholar
- 7.J. Clark. XSL Transformations (XSLT). W3C Recommendation, Nov. 1999. http://www.w3.org/TR/xslt.
- 8.J. Clark and S. DeRose. XML Path Language (XPath). W3C Recommendation, Nov. 1999. http://www.w3.org/TR/xpath.
- 9.A. Deutsch and V. Tannen. Containment for classes of XPath expressions under integrity constraints. In KRDB, 2001.Google Scholar
- 10.G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In VLDB, 2002.Google Scholar
- 11.D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic. The MIT Press, 2000.Google Scholar
- 14.G. Miklau and D. Suciu. Containment and equivalence of XPath expressions. In PODS, 2002.Google Scholar
- 15.T. Milo, D. Suciu, and V. Vianu. Typechecking for XML transformers. In PODS, 2001.Google Scholar
- 16.M. Murata. Extended path expressions for XML. In PODS, 2001.Google Scholar
- 17.F. Neven and T. Schwentick. Expressive and efficient languages for tree-structured data. In PODS, 2000.Google Scholar
- 18.D. Olteanu, H. Meuss, T. Furche, and F. Bry. XPath: Looking forward. In Workshop on XML-Based Data Management (XMLDM), 2002.Google Scholar
- 19.P. Ramanan. Efficient algorithms for minimizing tree pattern queries. In SIGMOD, 2002.Google Scholar
- 21.J. Robie, J. Lapp, and D. Schach. XML Query Language (XQL). Workshop on XML Query Languages, Dec. 1998.Google Scholar
- 22.H. Thompson et al. XML Schema. W3C Working Draft, May 2001. http://www.w3.org/XML/Schema.
- 23.P. Wadler. Two semantics for XPath. Technical report, Bell Labs, 2000.Google Scholar
- 24.P. Wood. On the equivalence of XML patterns. In Computational Logic, 2000.Google Scholar
- 25.P. Wood. Minimising simple XPath expressions. In WebDB, 2001.Google Scholar