Parallel Join

  • Hasso Plattner
Chapter

Abstract

The join operation is one of the most cost-intensive tasks for in-memory databases. As today’s systems introduce more and more parallelism, intra-operator parallelization moves into focus.

References

  1. [AKN12]
    M.-C. Albutiu, A. Kemper, T. Neumann, Massively parallel sort-merge joins in main memory multi-core database systems. Proc. VLDB 5(10), 1064–1075 (2012)Google Scholar
  2. [KKL+09]
    C. Kim, T. Kaldewey, V.W. Lee, E. Sedlar, A.D. Nguyen, N. Satish, J. Chhugani, A. Di Blas, P. Dubey, Sort vs. hash revisited: fast join implementation on modern multi-core CPUs, in VLDB, 2009Google Scholar
  3. [MBK82]
    S. Manegold, P. Boncz, M. Kersten, Optimizing main-memory join on modern hardware. IEEE Trans. Knowledge Data Eng. 14, 709–730 (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Hasso Plattner
    • 1
  1. 1.Enterprise Platform and Integration ConceptsHasso Plattner InstitutePotsdamGermany

Personalised recommendations