AdaptDB: Adaptive Partitioning for Distributed Joins
Big data analytics often involves complex join queries over two or more tables. Such join processing is expensive in a distributed setting both because large amounts of data must be read from disk, and because of data shuffling across the network. Many techniques based on data partitioning have b...
Main Authors: | Jundal, Alekh, Lu, Yi, Shanbhag, Anil Atmanand, Madden, Samuel R |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Association for Computing Machinery (ACM)
2018
|
Online Access: | http://hdl.handle.net/1721.1/116354 https://orcid.org/0000-0002-2718-9443 https://orcid.org/0000-0002-0925-1354 https://orcid.org/0000-0002-7470-3265 |
Similar Items
-
AdaptDB : adaptive partitioning for distributed joins
by: Lu, Yi, (Ph. D. in Computer Science) Massachusetts Institute of Technology
Published: (2017) -
An adaptive partitioning scheme for ad-hoc and time-varying database analytics
by: Shanbhag, Anil (Anil Atmanand)
Published: (2016) -
Amoeba: A Shape changing Storage System for Big Data
by: Shanbhag, Anil Atmanand, et al.
Published: (2021) -
A robust partitioning scheme for ad-hoc query workloads
by: Shanbhag, Anil, et al.
Published: (2021) -
Cryptographic Treatment of CryptDB's Adjustable Join
by: Popa, Raluca Ada, et al.
Published: (2012)