000K  utf8
0100  1826699791
1100  $c2022
1500  eng
2051  10.5441/002/edbt.2022.03
3000  Lasch, Robert
3010  Demirsoy, Suleyman S.
3010  Färber, Christian
3010  May, Norman
3010  Moghaddamfar, Mehdi
3010  Sattler, Kai-Uwe
4000  Bandwidth-optimal relational joins on FPGAs$hOpenProceedings.org  [Lasch, Robert]
4030  $nOpenProceedings.org
4060  13 Seiten
4209  The relational equality-join is one of the most performancecritical operators in database management systems. For this reason, there have been many attempts to implement this operator on FPGAs in various sort-merge and hash join variants. However, most achieve suboptimal performance because they ineffectively use the limited memory bandwidths of current FPGA platforms. In this paper, we present an FPGA-based implementation of the partitioned hash join (PHJ), where both PHJ phases are executed on the FPGA. Contrary to prior work, we consider a commonly used PCIe-attached FPGA card with dedicated on-board memory. We discuss how to utilize this on-board memory effectively and propose a solution that uses this memory to store partitioned tuples, minimizing data transfers to system memory and thus optimally using the available bandwidth. In our experimental evaluation we demonstrate up to 2x faster end-to-end join times than state-of-the-art 32-threaded hash join implementations on the CPU.
4950  https://doi.org/10.5441/002/edbt.2022.03$xR$3Volltext$534
4961  http://uri.gbv.de/document/gvk:ppn:1826699791
5051  004