The join is a commonly used operation in databases systems. As data volumes explode, join operations between two large relations become challenging. To overcome this challenge, some research adopts FPGAs (field programmable gate arrays) to accelerate this operation. However, increasing the bandwidth between accelerators and main memory provides additional opportunity for improvement. In this paper, we propose a locality-aware hash-join algorithm, and apply this to explore the potential of using FPGAs to accelerate hash-join operations in databases. The tuples in the input tables are partitioned into small buckets such that each bucket can fit into BRAM (Block RAM) of the FPGA. Hash-join probe operations are only performed on buckets with the same bucket number in these two tables. Analysis shows that the proposed method can take advantage of large memory bandwidth and thus provide a high throughput.
|Number of pages||4|
|Publication status||Published - 2016|
|Event||12th International Summer School on Advanced Computer Architecture and Compilation for High-Performance and Embedded Systems - Fiuggi, Italy|
Duration: 10 Jul 2016 → 16 Jul 2016
|Other||12th International Summer School on Advanced Computer Architecture and Compilation for High-Performance and Embedded Systems|
|Abbreviated title||ACACES 2016|
|Period||10/07/16 → 16/07/16|