Abstract | ||
---|---|---|
Over the last decade, significant research effort has been put into improving the performance of hash join operation on GPUs. Over the same period, there have been significant changes to the GPU architecture. Hence in this paper, we first revisit the major GPU hash join implementations in the last decade and detail how they take advantage of different GPU architecture features. We then perform a comprehensive performance evaluation of these implementations using different generations of GPUs released over the last decade, which helps to shed light on the impact of different architecture features and to identify the factors guiding the choice of these features. We then study how data characteristics like skew and match rate impact the performance of GPU hash join implementations and propose techniques to improve the performance of existing implementations under such conditions. Finally, we perform an in-depth comparison of the performance and cost-efficiency of GPU hash join implementations against state-of-the-art CPU implementation. |
Year | DOI | Venue |
---|---|---|
2020 | 10.1007/s10619-019-07280-z | DISTRIBUTED AND PARALLEL DATABASES |
Keywords | Field | DocType |
GPU, Hash join, Partitioning | Graphics,Hash join,Data structure,Architecture,Computer science,Parallel computing,Implementation,Skew,Match rate,Distributed computing | Journal |
Volume | Issue | ISSN |
38 | 4 | 0926-8782 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Johns Paul | 1 | 26 | 5.46 |
Bingsheng He | 2 | 2810 | 179.09 |
Shengliang Lu | 3 | 2 | 4.08 |
C. T. Lau | 4 | 119 | 66.91 |