Accelerating Join Operation for Relational Databases with FPGAs

Robert J. Halstead,Bharat Sukhwani,Hong Min,Mathew Thoennes,Parijat Dube,Sameh Asaad,Balakrishna Iyer

FCCM（2013）

引用 79|浏览104

暂无评分

摘要

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 11xspeedup over software.

查看译文

关键词

field programmable gate array,accelerating join operation,false positive,relational databases,database operation,conflict resolution,linear time,pcie-attached system,hash-join engine,time complexity,fpga,vectors,pipelines,analytics,false positives,computational complexity,databases,benchmark testing,field programmable gate arrays,relational database

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要