Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited

Download Now
Provided by: ETH Zurich
Topic: Storage
Format: PDF
In this paper, the authors experimentally study the performance of main-memory, parallel, multi-core join algorithms, focusing on sort-merge and (radix-)hash join. The relative performance of these two join approaches have been a topic of discussion for a long time. With the advent of modern multi-core architectures, it has been argued that sort-merge join is now a better choice than radix-hash join. This claim is justified based on the width of SIMD instructions (sort-merge outperforms radix-hash join once SIMD is sufficiently wide), and NUMA awareness.
Download Now

Find By Topic