Name
Abstract | ||
|---|---|---|
Driven by the two main hardware trends increasing main memory and massively parallel multi-core processing in the past few years, there has been much research effort in parallelizing well-known join algorithms. However, the non-uniform memory access (NUMA) of these architectures to main memory has only gained limited attention in the design of these algorithms. We study recent proposals of main memory hash join implementations and identify their major performance problems on NUMA architectures. We then develop a NUMA-aware hash join for massively parallel environments, and show how the specific implementation details affect the performance on a NUMA system. Our experimental evaluation shows that a carefully engineered hash join implementation outperforms previous high performance hash joins by a factor of more than two, resulting in an unprecedented throughput of 3/4 billion join argument quintuples per second. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-319-13960-9_1 | IN MEMORY DATA MANAGEMENT AND ANALYSIS |
Field | DocType | Volume |
Hash join,Joins,Memory bandwidth,Computer science,CPU cache,Massively parallel,Parallel computing,Hash function,Throughput,Database,Hash table | Conference | 8921 |
ISSN | Citations | PageRank |
0302-9743 | 19 | 0.83 |
References | Authors | |
8 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Harald Lang | 1 | 55 | 4.24 |
| Viktor Leis | 2 | 425 | 30.26 |
| Martina-Cezara Albutiu | 3 | 122 | 6.72 |
| Thomas Neumann | 4 | 2523 | 156.50 |
| Alfons Kemper | 5 | 3519 | 769.50 |