publication . Article . Other literature type . Preprint . Report . 2012

Massively parallel sort-merge joins in main memory multi-core database systems

Thomas Neumann;
Open Access
  • Published: 01 Jan 2012 Journal: Proceedings of the VLDB Endowment, volume 5, pages 1,064-1,075 (issn: 2150-8097, Copyright policy)
  • Publisher: VLDB Endowment
  • Country: Germany
Abstract
Comment: VLDB2012
Subjects
free text keywords: Multi-core processor, Sorting, Hash join, Massively parallel, Database, computer.software_genre, computer, Computer science, Parallel computing, Data mining, Joins, Hash function, Scalability, sort, Computer Science - Databases, ddc:000, ddc:
Related Organizations
25 references, page 1 of 2

[1] S. Blanas, Y. Li, and J. M. Patel. Design and Evaluation of Main Memory Hash Join Algorithms for Multi-core CPUs. In SIGMOD, pages 37-48, 2011. [OpenAIRE]

[2] S. Blanas and J. M. Patel. How Efficient is our Radix Join Implementation? http://pages.cs.wisc.edu/ ~sblanas/files/comparison.pdf, 2011.

[3] P. A. Boncz, S. Manegold, and M. L. Kersten. Database Architecture Optimized for the New Bottleneck: Memory Access. In VLDB, pages 54-65, 1999.

[4] P. A. Boncz, S. Manegold, and M. L. Kersten. Database Architecture Evolution: Mammals Flourished long before Dinosaurs became Extinct. PVLDB, 2(2):1648-1653, 2009.

[5] S. Chen, A. Ailamaki, P. B. Gibbons, and T. C. Mowry. Improving Hash Join Performance through Prefetching. ACM TODS, 32(3):17, 2007.

[6] J. Chhugani, A. D. Nguyen, V. W. Lee, W. Macy, M. Hagog, Y.-K. Chen, A. Baransi, S. Kumar, and P. Dubey. Efficient Implementation of Sorting on Multi-Core SIMD CPU Architecture. PVLDB, 1(2):1313-1324, 2008.

[7] J. Claussen, A. Kemper, D. Kossmann, and C. Wiesner. Exploiting Early Sorting and Early Partitioning for Decision Support Query Processing. The VLDB Journal, 9:190-213, 2000.

[8] D. J. DeWitt, S. Ghandeharizadeh, D. A. Schneider, A. Bricker, H.-I. Hsiao, and R. Rasmussen. The Gamma Database Machine Project. IEEE TKDE, 2(1):44-62, 1990.

[9] D. J. DeWitt, J. F. Naughton, D. A. Schneider, and S. Seshadri. Practical Skew Handling in Parallel Joins. In VLDB, pages 27-40, 1992.

[10] F. Fa¨rber, S. K. Cha, J. Primsch, C. Bornho¨vd, S. Sigg, and W. Lehner. SAP HANA Database: Data Management for Modern Business Applications. ACM SIGMOD Record, 40(4):45-51, 2011.

[11] P. W. Frey, R. Goncalves, M. Kersten, and J. Teubner. Spinning Relations: High-speed Networks for Distributed Join Processing. In DaMoN, pages 27-33, 2009.

[12] G. Graefe. Sort-Merge-Join: An Idea Whose Time Has(h) Passed? In ICDE, pages 406-417, 1994.

[13] G. Graefe. New algorithms for join and grouping operations. Computer Science - Research&Development, 27(1):3-27, 2012.

[14] B. He, K. Yang, R. Fang, M. Lu, N. K. Govindaraju, Q. Luo, and P. V. Sander. Relational Joins on Graphics Processors. In SIGMOD, pages 511-524, 2008.

[15] D. Inkster, M. Zukowski, and P. Boncz. Integration of VectorWise with Ingres. ACM SIGMOD Record, 40:45-53, 2011. [OpenAIRE]

25 references, page 1 of 2
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Article . Other literature type . Preprint . Report . 2012

Massively parallel sort-merge joins in main memory multi-core database systems

Thomas Neumann;