Skip to main content
SpringerLink
Log in

Main Memory Implementations for Binary Grouping

  • Conference paper
Database and XML Technologies (XSym 2005)

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

Included in the following conference series:

Abstract

An increasing number of applications depend on efficient storage and analysis features for XML data. Hence, query optimization and efficient evaluation techniques for the emerging XQuery standard become more and more important. Many XQuery queries require nested expressions. Unnesting them often introduces binary grouping.

We introduce several algorithms implementing binary grouping and analyze their time and space complexity. Experiments demonstrate their performance.

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

Access this chapter

Log in via an institution
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. Bitton, D., DeWitt, D.J.: Duplicate record elimination in large data files. ACM TODS 8(2), 255–265 (1983)

    Article  MATH  Google Scholar 

  2. Chatziantoniou, D., Akinde, M., Johnson, T., Kim, S.: The MD-Join: An Operator for Complex OLAP. In: Proc. ICDE, pp. 524–533 (2001)

    Google Scholar 

  3. Cluet, S., Moerkotte, G.: Efficient evaluation of aggregates on bulk types. In: Proc. of 5-th DBPL (1995)

    Google Scholar 

  4. Cluet, S., Moerkotte, G.: Nested queries in object bases. Technical Report RWTH-95-06, GemoReport64, RWTH Aachen/INRIA (1995)

    Google Scholar 

  5. Corman, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)

    Google Scholar 

  6. Van den Bercken, J., Schneider, M., Seeger, B.: Plug&join: An easy-to-use generic algorithm for efficiently processing equi and non-equi joins. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol. 1777, pp. 495–509. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. DeWitt, D.J., Katz, R., Olken, F., Shapiro, L., Stonebraker, M., Wood, D.: Implementation techniques for main memory database systems. In: Proc. of the ACM SIGMOD, pp. 1–8 (June 1984)

    Google Scholar 

  8. DeWitt, D.J., Naughton, J.F., Schneider, D.A.: An evaluation of non-equijoin algorithms. In: Proc. VLDB, pp. 443–452 (1991)

    Google Scholar 

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

    Article  Google Scholar 

  10. Graefe, G.: Sort-merge-join: An idea whose time has(h) passed? In: Proc. ICDE, pp. 406–417 (1994)

    Google Scholar 

  11. Graefe, G.: Executing nested queries. In: BTW, pp. 58–77 (2003)

    Google Scholar 

  12. Graefe, G., Bunker, R., Cooper, S.: Hash joins and hash teams in Microsoft SQL server. In: Proc. VLDB, pp. 86–97 (1998)

    Google Scholar 

  13. Graefe, G., Linville, A., Shapiro, L.D.: Sort vs. hash revisited. hash revisited. IEEE TKDE 6(6), 934–944 (1994)

    Google Scholar 

  14. Haas, L.M., Carey, M.J., Livny, M., Shukla, A.: Seeking the truth about ad hoc join costs. VLDB Journal 6(3), 241–256 (1997)

    Article  Google Scholar 

  15. Helmer, S., Neumann, T., Moerkotte, G.: Early grouping gets the skew. Technical Report TR-02-009, University of Mannheim (2002)

    Google Scholar 

  16. Helmer, S., Neumann, T., Moerkotte, G.: A robust scheme for multilevel extendible hashing. Proc. 18th ISCIS, pp. 218–225 (2003)

    Google Scholar 

  17. May, N., Helmer, S., Moerkotte, G.: Nested queries and quantifiers in an ordered context. In: Proc. ICDE, pp. 239–250 (2004)

    Google Scholar 

  18. May, N., Helmer, S., Moerkotte, G.: Main memory implementations for binary grouping. Technical report, University of Mannheim (2005), Available at http://pi3.informatik.uni-mannheim.de/publikationen.html

  19. Simmen, D.E., Shekita, E.J., Malkemus, T.: Fundamental techniques for order optimization. SIGMOD Record 25(2), 57–67 (1996)

    Article  Google Scholar 

  20. Steenhagen, H.J., Apers, P.M.G., Blanken, H.M., de By, R.A.: From nestedloop to join queries in OODB. In: Proc. VLDB, pp. 618–629 (1994)

    Google Scholar 

  21. Westmann, T., Moerkotte, G.: Variations on grouping and aggregation. Technical report, University of Mannheim (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Mannheim, B6, 29, 68131, Mannheim, Germany

    Norman May & Guido Moerkotte

Authors
  1. Norman May
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guido Moerkotte
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing, National University of Singapore,  

    Stéphane Bressan

  2. Dipartimento di Elettronica e Informazione, Politecnico di Milano, Piazza L. Da Vinci, 32, I20133, Milano, Italy

    Stefano Ceri

  3. Department of Computer Science, ETH Zurich, Switzerland

    Ela Hunt

  4. Department of Computer and Information Science, University of Pennsylvania, 19104, Philadelphia, PA, USA

    Zachary G. Ives

  5. LIRMM - UMR 5506 CNRS, Université Montpellier 2, 161 Rue Ada, F-34392, Montpellier Cedex 5

    Zohra Bellahsène

  6. Microsoft Corporation, One Microsoft Way, 98052, Redmond, WA, USA

    Michael Rys

  7. Universität Duisburg-Essen,  

    Rainer Unland

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

May, N., Moerkotte, G. (2005). Main Memory Implementations for Binary Grouping. In: Bressan, S., et al. Database and XML Technologies. XSym 2005. Lecture Notes in Computer Science, vol 3671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11547273_12

Download citation

  • DOI: https://doi.org/10.1007/11547273_12

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31968-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation