申请试用
HOT
登录
注册
 
Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited

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

陈傲天
/
发布于
/
1872
人观看
In this paper we 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 multicore 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)
2 点赞
0 收藏
1下载
确认
3秒后跳转登录页面
去登陆