A Relative Cost Model of XQuery for Optimization Based on Rewriting

XQuery is a functional query language for XML. We propose a relative XQuery cost model that is able to estimate the performance gain during source level transformation. This research facilitates the evaluation of various rewriting techniques without introducing real engines. The cost model consists of simple recursive functions based on functional language constructs. They are determined using formal semantics and other known efficient algorithms. Analytic comparison of costs between expressions before and after transformation is possible in an engine-independent manner. The relativity of the model allows uninterpreted components within, which do not affect the mathematical proof of the comparison. Moreover, it can be tailored to reflect engine specific evaluation

[1]  Alon Y. Halevy,et al.  Efficient query reformulation in peer data management systems , 2004, SIGMOD '04.

[2]  Jeffrey F. Naughton,et al.  Efficient XML-to-SQL Query Translation: Where to Add the Intelligence? , 2004, VLDB.

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

[4]  Sherif Sakr,et al.  XQuery on SQL Hosts , 2004, VLDB.

[5]  Wolfgang Meier,et al.  eXist: An Open Source Native XML Database , 2002, Web, Web-Services, and Database Systems.

[6]  Prasan Roy,et al.  Efficient and extensible algorithms for multi query optimization , 1999, SIGMOD '00.

[7]  Christoph Koch,et al.  On the role of composition in XQuery , 2005, WebDB.

[8]  I. Manolescu,et al.  Towards Microbenchmarking XQuery , 2008 .

[9]  Philip Wadler,et al.  A Semi-monad for Semi-structured Data , 2001, ICDT.

[10]  Jignesh M. Patel,et al.  Estimating Answer Sizes for XML Queries , 2002, EDBT.

[11]  Goetz Graefe,et al.  Query evaluation techniques for large databases , 1993, CSUR.

[12]  Michael J. Carey,et al.  The BEA streaming XQuery processor , 2004, The VLDB Journal.

[13]  Cong Yu,et al.  TIMBER: A native XML database , 2002, The VLDB Journal.

[14]  Alexandra Poulovassilis,et al.  Algebraic query optimisation for database programming languages , 1996, The VLDB Journal.

[15]  Ioana Manolescu,et al.  Answering XML Queries on Heterogeneous Data Sources , 2001, VLDB.

[16]  Christopher Ré,et al.  A Complete and Efficient Algebraic Compiler for XQuery , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[17]  Alin Deutsch,et al.  The NEXT Logical Framework for XQuery , 2004, VLDB.

[18]  Masatoshi Yoshikawa,et al.  Rewriting XQuery by child-path folding , 2007 .

[19]  Ioana Manolescu,et al.  XMark: A Benchmark for XML Data Management , 2002, VLDB.

[20]  Juliana Freire,et al.  From XML schema to relations: a cost-based approach to XML storage , 2002, Proceedings 18th International Conference on Data Engineering.

[21]  Scott Boag,et al.  XQuery 1.0 : An XML Query Language , 2007 .

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

[23]  Chun Zhang,et al.  Cost-based optimization in DB2 XML , 2006, IBM Syst. J..

[24]  Hamid Pirahesh,et al.  Magic is relevant , 1990, SIGMOD '90.