Putting XML Query Algebras into Context

While the XML community appears to be converging on XQuery as a standard for querying XML documents, there is currently much less consensus about a standard algebra. In this paper, we describe the algebra we have implemented in our XML query evaluation system. Our goal was to specify an algebra that is powerful enough to handle the XQuery language, yet simple enough to be amenable to optimization and implementation. A novel aspect of our algebra is the use of the context construct. Whereas XML algebras using bindings must at some point resort to "shredding" XML into collections of tuples that may need to be recombined by subsequent operators (often, for example, in a result construction step), the context construct allows us to "carry along" the structure of the input XML in a way that is transparent to the optimizer and to later operators in the query plan. It is our hope that publishing our algebra, and the context construct in particular, will contribute to the discussion of what features and characteristics an XML algebra should possess.

[1]  A. Tarski A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[2]  E. F. Codd,et al.  A Relational Model for Large Shared Data Banks , 1970 .

[3]  Alfred V. Aho,et al.  Universality of data retrieval languages , 1979, POPL.

[4]  Peter M. G. Apers,et al.  Pipelining in query execution , 1990, Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications.

[5]  Goetz Graefe,et al.  Experiences building the open OODB query optimizer , 1993, SIGMOD Conference.

[6]  Sushil Jajodia,et al.  Proceedings of the 1993 ACM SIGMOD international conference on Management of data , 1993, SIGMOD 1993.

[7]  Serge Abiteboul,et al.  From structured documents to novel query facilities , 1994, SIGMOD '94.

[8]  David Maier,et al.  An Algebraic Framework for Physical OODB Design , 1995, DBPL.

[9]  David Maier,et al.  Towards an effective calculus for object query languages , 1995, SIGMOD '95.

[10]  Charles L. A. Clarke,et al.  An Algebra for Structured Text Search and a Framework for its Implementation , 1995, Comput. J..

[11]  Roy Goldman,et al.  Lore: a database management system for semistructured data , 1997, SGMD.

[12]  Serge Abiteboul,et al.  Querying Semi-Structured Data , 1997, Encyclopedia of Database Systems.

[13]  David Maier Database Desiderata for an XML Query Language , 1998, QL.

[14]  Jennifer Widom,et al.  Query Optimization for XML , 1999, VLDB.

[15]  Jennifer Widom,et al.  Optimizing Branching Path Expressions , 1999 .

[16]  David J. DeWitt,et al.  OPT++ : an object-oriented implementation for extensible database query optimization , 1999, The VLDB Journal.

[17]  Steven J. DeRose,et al.  XML Path Language (XPath) Version 1.0 , 1999 .

[18]  David Beech,et al.  A Formal Data Model and Algebra for XML , 1999 .

[19]  David J. DeWitt,et al.  NiagaraCQ: a scalable continuous query system for Internet databases , 2000, SIGMOD '00.

[20]  David J. DeWitt,et al.  Architecting a Network Query Engine for Producing Partial Results , 2000, WebDB.

[21]  Laks V. S. Lakshmanan,et al.  TAX: A Tree Algebra for XML , 2001, DBPL.

[22]  Hamid Pirahesh,et al.  Efficiently publishing relational data as XML documents , 2001, The VLDB Journal.

[23]  David J. DeWitt,et al.  The Niagara Internet Query System , 2001, IEEE Data Eng. Bull..

[24]  Jeffrey F. Naughton,et al.  Estimating the Selectivity of XML Path Expressions for Internet Scale Applications , 2001, VLDB.

[25]  Donald D. Chamberlin,et al.  XQuery: a query language for XML , 2003, SIGMOD '03.

[26]  Donald D. Chamberlin,et al.  W3C World Wide Web Consortium , 2003 .