A robust partitioning scheme for ad-hoc query workloads
© 2017 Association for Computing Machinery. Data partitioning is crucial to improving query performance and severalworkload-based partitioning techniques have been proposed in database literature. However, many modern analytic applications involve ad-hoc or exploratory analysis where users do not ha...
Main Authors: | Shanbhag, Anil, Jindal, Alekh, Madden, Samuel, Quiane, Jorge, Elmore, Aaron J. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
ACM
2021
|
Online Access: | https://hdl.handle.net/1721.1/137858 |
Similar Items
-
An adaptive partitioning scheme for ad-hoc and time-varying database analytics
by: Shanbhag, Anil (Anil Atmanand)
Published: (2016) -
CARTILAGE: adding flexibility to the Hadoop skeleton
by: Jindal, Alekh, et al.
Published: (2021) -
Robust data partitioning for ad-hoc query processing
by: Nguyen, Qui T
Published: (2016) -
CARTILAGE: adding flexibility to the Hadoop skeleton
by: Jindal, Alekh, et al.
Published: (2022) -
AdaptDB: Adaptive Partitioning for Distributed Joins
by: Jundal, Alekh, et al.
Published: (2018)