Skip to main content

Let a Single FLWOR Bloom

(To Improve XQuery Plan Generation)

  • Conference paper
Database and XMLTechnologies (XSym 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4704))

Included in the following conference series:

Abstract

To globally optimize execution plans for XQuery expressions, a plan generator must generate and compare plan alternatives. In proven compiler architectures, the unit of plan generation is the query block. Fewer query blocks mean a larger search space for the plan generator and lead to a generally higher quality of the execution plans. The goal of this paper is to provide a toolkit for developers of XQuery evaluators to transform XQuery expressions into expressions with as few query blocks as possible.

Our toolkit takes the form of rewrite rules merging the inner and outer FLWOR expressions into single FLWORs. We focus on previously unpublished rewrite rules and on inner FLWORs occurring in the for, let, and return clauses in the outer FLWOR.

This work was supported by the Deutsche Forschungsgemeinschaft under grant MO 507/10-1.

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. Aho, A., Sethi, R., Ullman, J.D.: Compilers: principles, techniques, and tools. Wesley Longman Publishing, Boston, MA, USA (1986)

    Google Scholar 

  2. Brantner, M., Kanne, C-C., Moerkotte, G.: Let a single FLWOR bloom. Technical report, University of Mannheim, TR-2007-007 (2007)

    Google Scholar 

  3. Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. In: SIGMOD, pp. 310–321 (2002)

    Google Scholar 

  4. Dayal, U.: Of nests and trees: A unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers. In: Proc. VLDB, pp. 197–208 (1987)

    Google Scholar 

  5. Hidders, J., et al.: How to recognise different kinds of tree patterns from quite a long way away. In: Proc. PLAN-X (2007)

    Google Scholar 

  6. May, N., et al.: XQuery processing in Natix with an emphasis on join ordering. In: XIME-P 2004. First International Workshop on XQuery Implementation, Experience and Perspectives (2004)

    Google Scholar 

  7. Al-Khalifa, S., et al.: Structural Joins: A primitive for efficient XML query pattern matching. In: ICDE, pages 141- (2002)

    Google Scholar 

  8. Boag, S., et al.: XQuery 1.0: An XML query language. Technical report, World Wide Web Consortium, W3C Recommendation (January 2007)

    Google Scholar 

  9. Fiebig, T., et al.: Anatomy of a native XML base management system. j-VLDB-J 11(4), 292–314 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  10. Ganski, R.A., Wong, H.K.T.: Optimization of nested SQL queries revisited. In: SIGMOD, pp. 23–33 (1987)

    Google Scholar 

  11. Graefe, G.: Query evaluation techniques for large databases. ACM Computing Surveys 25(2), 73–170 (1993)

    Article  Google Scholar 

  12. Grust, T., Keulen, M.v.: Tree awareness for relational DBMS kernels: Staircase Join. In: Intelligent Search on XML Data, pp. 231–245 (2003)

    Google Scholar 

  13. Hidders, J., Michiels, P.: Avoiding unnecessary ordering operations in XPath. In: Database Programming Languages, pp. 54–70 (2003)

    Google Scholar 

  14. Josifovski, V., Fontoura, M., Barta, A.: Querying XML streams. j-VLDB-J 14(2), 197–210 (2005)

    Article  Google Scholar 

  15. May, N., Helmer, S., Moerkotte, G.: Strategies for query unnesting in XML databases. ACM Transactions on Database Systems 31(3), 968–1013 (2006)

    Article  Google Scholar 

  16. Michiels, P., Mihaila, G., Siméon, J.: Put a tree pattern in your algebra. In: Proc. ICDE (2007)

    Google Scholar 

  17. Pirahesh, H., Hellerstein, J.M., Hasan, W.: Extensible/rule based query rewrite optimization in starburst. In: SIGMOD, pp. 39–48 (1992)

    Google Scholar 

  18. Seshadri, P., Pirahesh, H., Leung, T.Y.C.: Complex query decorrelation. In: Proc. ICDE, pp. 450–458 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Denilson Barbosa Angela Bonifati Zohra Bellahsène Ela Hunt Rainer Unland

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brantner, M., Kanne, CC., Moerkotte, G. (2007). Let a Single FLWOR Bloom . In: Barbosa, D., Bonifati, A., Bellahsène, Z., Hunt, E., Unland, R. (eds) Database and XMLTechnologies. XSym 2007. Lecture Notes in Computer Science, vol 4704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75288-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75288-2_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75287-5

  • Online ISBN: 978-3-540-75288-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics