Skip to main content

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

  • Conference paper
  • First Online:
Advances in Databases and Information Systems (ADBIS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2435))

Abstract

Today it is widely recognized that optimization based on rewriting leads to faster query execution. The role of a query rewrit- ing 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 in- ternal 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 imple- mented 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Peter Fankhauser, “XQuery Formal Semantics:State and Challenges”, ACM SIG-MOD Record 30(3):14–19, 2001

    Article  Google Scholar 

  2. Mary Fernandez, Jerome Simeon, Philip Wadler. “A Semistructured Monad for Semistructured Data”, Proceedings ICDT Conference, 2001.

    Google Scholar 

  3. Ioana Manolescu, Daniela Florescu, Donald Kossmann, “Answering XML Queries on Heterogeneous Data Sources”, Proceedings 27th VLDB Conference, 2001.

    Google Scholar 

  4. Won Kim. “On Optimizing an SQL-like Nested Query”, ACM Transactions on Database Systems, 7(3), September 1982.

    Google Scholar 

  5. Richard A. Gansky and Harry K.T. Wong. Optimization of Nested SQL Queries Revisited. Proceedings ACM SIGMOD Conference, pp.23–33, 1987.

    Google Scholar 

  6. Umeshwar Dayal. “Of Nests and Trees: A Unified Approach to Processing Queries that Contain Nested Subqueries, Aggregates, and Quantifiers”, Proceedings 13th VLDB Conference, 1987.

    Google Scholar 

  7. Maxim Grinev, Sergei Kuznetsov. “An Integrated Approach to Semantic-Based Searching by Metadata over the Internet/Intranet”, Proceedings 5th ADBIS Conference, Professional Communications and Reports, Vol. 2, 2001

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grinev, M., Kuznetsov, S. (2002). Towards an Exhaustive Set of Rewriting Rules for XQuery Optimization: BizQuery Experience. In: Manolopoulos, Y., Návrat, P. (eds) Advances in Databases and Information Systems. ADBIS 2002. Lecture Notes in Computer Science, vol 2435. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45710-0_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-45710-0_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44138-0

  • Online ISBN: 978-3-540-45710-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics