2013 IEEE 21st Annual International Symposium on Field-Programmable Custom Computing Machines 2013
DOI: 10.1109/fccm.2013.17
|View full text |Cite
|
Sign up to set email alerts
|

Accelerating Join Operation for Relational Databases with FPGAs

Abstract: 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 greate… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 47 publications
(21 citation statements)
references
References 13 publications
0
21
0
Order By: Relevance
“…Regardless of the specifics, SQL remains highly applicable in the Big Data era thanks to the power of its declarative syntax. As such, significant efforts have been made in improving the performance of SQL, targeting parallel heterogeneous hardware architectures, which incorporates many processor types in a single machine [5,6,7,8,11,12,13,14,16].…”
Section: Introductionmentioning
confidence: 99%
“…Regardless of the specifics, SQL remains highly applicable in the Big Data era thanks to the power of its declarative syntax. As such, significant efforts have been made in improving the performance of SQL, targeting parallel heterogeneous hardware architectures, which incorporates many processor types in a single machine [5,6,7,8,11,12,13,14,16].…”
Section: Introductionmentioning
confidence: 99%
“…Obtaining an optimal scheduling in BSV can sometimes require some extra effort from the designer, due to the strict sequentially consistent paradigm of the language, which might not be obvious to designers with module mkSorter (SortBox#(n,t) [2], &temp [3]); compAndSwap(&temp [4], &temp [5]); compAndSwap(&temp [6], &temp [7]); ... an RTL background. Although Bluespec adopts many syntax expressions from SystemVerilog, the learning curve is steep even for developers with background in hardware design.…”
Section: A Bluespec Systemverilogmentioning
confidence: 99%
“…Mueller et al [3] presented sorting networks and the same median operator with sliding window that we use in this work. Halstead et al [4] accelerate join operations using an FPGA, where columns with identical values are chained together in an address table and the hash probe is done in parallel. Istvan et al present an FPGAbased hash table design with chaining and parallel lookups for a memcached server [33].…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations