Towards an exhaustive set of rewriting rules for XQuery optimization: BizQuery experience

8Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Grinev, M., & Kuznetsov, S. (2002). Towards an exhaustive set of rewriting rules for XQuery optimization: BizQuery experience. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2435 LNCS, pp. 340–345). Springer Verlag. https://doi.org/10.1007/3-540-45710-0_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free