Name
Abstract | ||
|---|---|---|
Database systems running on a cluster of machines, i.e. rack-scale databases, are a common architecture for many large databases and data appliances. As the data movement across machines is often a significant bottleneck, these systems typically use a low-latency, high-throughput network such as InfiniBand. To achieve the necessary performance, parallel join algorithms must take advantage of the primitives provided by the network to speed up data transfer. In this paper we focus on implementing parallel in-memory joins using Remote Direct Memory Access (RDMA), a communication mechanism to transfer data directly into the memory of a remote machine. The results of this paper are, to our knowledge, the first detailed analysis of parallel hash joins using RDMA. To capture their behavior independently of the network characteristics, we develop an analytical model and test our implementation on two different types of networks. The experimental results show that the model is accurate and the resulting distributed join exhibits good performance. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2723372.2750547 | ACM SIGMOD Conference |
Field | DocType | Citations |
Bottleneck,Joins,Rack,InfiniBand,Data transmission,Computer science,Parallel computing,Hash function,Remote direct memory access,Database,Speedup,Distributed computing | Conference | 20 |
PageRank | References | Authors |
0.66 | 22 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Claude Barthels | 1 | 42 | 2.26 |
| Simon Loesing | 2 | 311 | 17.10 |
| Gustavo Alonso | 3 | 5476 | 612.79 |
| Donald Kossmann | 4 | 6220 | 603.55 |