Abstract | ||
---|---|---|
We propose the algorithms for performing multiway joins using a new type of coarse grain reconfigurable hardware accelerator~-- ``Plasticine''~-- that, compared with other accelerators, emphasizes high compute capability and high on-chip communication bandwidth. Joining three or more relations in a single step, i.e. multiway join, is efficient when the join of any two relations yields too large an intermediate relation. We show at least 200X speedup for a sequence of binary hash joins execution on Plasticine over CPU. We further show that in some realistic cases, a Plasticine-like accelerator can make 3-way joins more efficient than a cascade of binary hash joins on the same hardware, by a factor of up to 45X. |
Year | Venue | DocType |
---|---|---|
2019 | arXiv: Databases | Journal |
Volume | Citations | PageRank |
abs/1905.13376 | 0 | 0.34 |
References | Authors | |
0 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Kunle Olukotun | 1 | 4532 | 373.50 |
Raghu Prabhakar | 2 | 35 | 2.75 |
Rekha Singhal | 3 | 0 | 3.04 |
Jeffrey D. Ullman | 4 | 13099 | 5226.28 |
Yaqi Zhang | 5 | 0 | 1.69 |