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.
Original languageEnglish
Pages1-4
Number of pages4
Publication statusPublished - 2016
Event12th International Summer School on Advanced Computer Architecture and Compilation for High-Performance and Embedded Systems - Fiuggi, Italy
Duration: 10 Jul 201616 Jul 2016

Other

Other12th International Summer School on Advanced Computer Architecture and Compilation for High-Performance and Embedded Systems
Abbreviated titleACACES 2016
CountryItaly
CityFiuggi
Period10/07/1616/07/16

    Research areas

  • Databases, Join, FPGAs, Acceleration, Locality-Aware

ID: 10408988