Towards an Exhaustive Set of Rewriting Rules for XQuery Optimization: BizQuery Experience

  • Authors:
  • Maxim Grinev;Sergey D. Kuznetsov

  • Affiliations:
  • -;-

  • Venue:
  • ADBIS '02 Proceedings of the 6th East European Conference on Advances in Databases and Information Systems
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Today it is widely recognized that optimization based on rewriting leads to faster query execution. The role of a query rewriting grows significantly when a query defined in terms of some view is processed. Using views is a good idea for building flexible virtual data integration systems with declarative query support. At present time such systems tend to be based on the XML data model and use XML as the internal data representation for processing query over heterogeneous data. Hence an elaborated algorithm of query rewriting is of great importance for efficient processing of XML declarative queries. This paper describes the query rewriting techniques for the XQuery language that is implemented as part of the BizQuery virtual data integration system. The goals of XQuery rewriting are stated. Query rewriting rules for FLWR expressions and for recursive XQuery functions are presented. Also the role of the XML schema in query rewriting is discussed.