DocumentCode
3434768
Title
A Spinning Join That Does Not Get Dizzy
Author
Frey, Philip W. ; Goncalves, Romulo ; Kersten, Maritn ; Teubner, Jens
Author_Institution
Syst. Group Dept. of Comput. Sci., ETH Zurich, Zurich, Czech Republic
fYear
2010
fDate
21-25 June 2010
Firstpage
283
Lastpage
292
Abstract
As network infrastructures with 10 Gb/s bandwidth and beyond have become pervasive and as cost advantages of large commodity-machine clusters continue to increase, research and industry strive to exploit the available processing performance for large-scale database processing tasks. In this work we look at the use of high-speed networks for distributed join processing. We propose Data Roundabout as alight weight transport layer that uses Remote Direct Memory Access (RDMA) to gain access to the throughput opportunities in modern networks. The essence of Data Roundabout is a ring shaped network in which each host stores one portion of a large database instance. We leverage the available bandwidth to (continuously) pump data through the high-speed network. Based on Data Roundabout, we demonstrate cyclo-join, which exploits the cycling flow of data to execute distributed joins. The study uses different join algorithms (hash join and sort-merge join) to expose the pitfalls and the advantages of each algorithm in the data cycling arena. The experiments show the potential of a large distributed main-memory cache glued together with RDMA into a novel distributed database architecture.
Keywords
Algorithm design and analysis; Bandwidth; Costs; Distributed computing; Distributed databases; Hardware; High-speed networks; Large-scale systems; Spinning; Throughput; Distributed Joins; Distributed Query Processing; RDMA;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems (ICDCS), 2010 IEEE 30th International Conference on
Conference_Location
Genoa, Italy
ISSN
1063-6927
Print_ISBN
978-1-4244-7261-1
Type
conf
DOI
10.1109/ICDCS.2010.23
Filename
5541677
Link To Document