Accelerating join operation for relational databases with FPGAs
RJ Halstead, B Sukhwani, H Min… - 2013 IEEE 21st …, 2013 - ieeexplore.ieee.org
2013 IEEE 21st Annual International Symposium on Field …, 2013•ieeexplore.ieee.org
In this paper, we investigate the use of field programmable gate arrays (FPGAs) to
accelerate relational joins. Relational join is one of the most CPU-intensive, yet commonly
used, database operations. Hashing can be used to reduce the time complexity from
quadratic (naïve) to linear time. However, doing so can introduce false positives to the
results which must be resolved. We present a hash-join engine on FPGA that performs
hashing, conflict resolution, and joining on a PCIe-attached system, achieving greater than …
accelerate relational joins. Relational join is one of the most CPU-intensive, yet commonly
used, database operations. Hashing can be used to reduce the time complexity from
quadratic (naïve) to linear time. However, doing so can introduce false positives to the
results which must be resolved. We present a hash-join engine on FPGA that performs
hashing, conflict resolution, and joining on a PCIe-attached system, achieving greater than …
In this paper, we investigate the use of field programmable gate arrays (FPGAs) to accelerate relational joins. Relational join is one of the most CPU-intensive, yet commonly used, database operations. Hashing can be used to reduce the time complexity from quadratic (naïve) to linear time. However, doing so can introduce false positives to the results which must be resolved. We present a hash-join engine on FPGA that performs hashing, conflict resolution, and joining on a PCIe-attached system, achieving greater than 11x speedup over software.
ieeexplore.ieee.org