Structural Properties of XPath Fragments

We study structural properties of each of the main sublanguages of XPath [8] 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.

[1]  Thomas Schwentick,et al.  Expressive and efficient pattern languages for tree-structured data (extended abstract) , 2000, PODS '00.

[2]  Heikki Mannila,et al.  Ordered and Unordered Tree Inclusion , 1995, SIAM J. Comput..

[3]  David Schach,et al.  XML Query Language (XQL) , 1998, QL.

[4]  Peter T. Wood,et al.  On the Equivalence of XML Patterns , 2000, Computational Logic.

[5]  Georg Gottlob,et al.  Efficient Algorithms for Processing XPath Queries , 2002, VLDB.

[6]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.

[7]  Yde Venema,et al.  Dynamic Logic by David Harel, Dexter Kozen and Jerzy Tiuryn. The MIT Press, Cambridge, Massachusetts. Hardback: ISBN 0–262–08289–6, $50, xv + 459 pages , 2002, Theory and Practice of Logic Programming.

[8]  Diego Calvanese,et al.  Reasoning in Expressive Description Logics , 2001, Handbook of Automated Reasoning.

[9]  Peter T. Wood,et al.  Containment for XPath Fragments under DTD Constraints , 2003, ICDT.

[10]  Makoto Murata,et al.  Extended path expressions of XML , 2001, PODS.

[11]  Peter T. Wood.  Minimising Simple XPath Expressions , 2001, WebDB.

[12]  Georg Gottlob,et al.  The complexity of XPath query evaluation , 2003, PODS.

[13]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[14]  Christoph M. Hoffmann,et al.  Pattern Matching in Trees , 1982, JACM.

[15]  P. Wadler.  Two semantics for XPath , 2000 .

[16]  Rajeev Rastogi,et al.  Efficient filtering of XML documents with XPath expressions , 2002, The VLDB Journal.

[17]  Prakash V. Ramanan,et al.  Efficient algorithms for minimizing tree pattern queries , 2002, SIGMOD '02.

[18]  Luc Segoufin,et al.  Typing and querying XML documents: some complexity bounds , 2003, PODS.

[19]  Dan Suciu,et al.  Typechecking for XML transformers , 2000, PODS '00.

[20]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[21]  Thomas Schwentick,et al.  XPath Containment in the Presence of Disjunction, DTDs, and Variables , 2003, ICDT.

[22]  Laks V. S. Lakshmanan,et al.  Minimization of tree pattern queries , 2001, SIGMOD '01.

[23]  Tim Furche,et al.  XPath: Looking Forward , 2002, EDBT Workshops.

[24]  Dan Suciu,et al.  Containment and equivalence for an XPath fragment , 2002, PODS.

[25]  Frank Neven,et al.  A formal model for an expressive fragment of XSLT , 2002, Inf. Syst..