DMCA
Adaptive Parallel Aggregation Algorithms (1995)
| Venue: | In ACM SIGMOD |
| Citations: | 61 - 2 self |
BibTeX
@INPROCEEDINGS{Shatdal95adaptiveparallel,
author = {Ambuj Shatdal and Jeffrey F. Naughton},
title = {Adaptive Parallel Aggregation Algorithms},
booktitle = {In ACM SIGMOD},
year = {1995},
pages = {104--114},
publisher = {ACM Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Aggregation and duplicate removal are common in SQL queries. However, in the parallel query processing literature, aggregate processing has received surprisingly little attention; furthermore, for each of the traditional parallel aggregation algorithms, there is a range of grouping selectivities where the algorithm performs poorly. In this work, we propose new algorithms that dynamically adapt, at query evaluation time, in response to observed grouping selectivities. Performance analysis via analytical modeling and an implementation on a workstation-cluster shows that the proposed algorithms are able to perform well for all grouping selectivities. Finally, we study the effect of data skew and show that for certain data sets the proposed algorithms can even outperform the best of traditional approaches. 1 Introduction SQL queries are replete with aggregate and duplicate elimination operations. One measure of the perceived importance of aggregation is that in the proposed TPCD benchmark...
Keyphrases
adaptive parallel aggregation algorithm analytical modeling parallel query processing literature sql query little attention perceived importance grouping selectivity introduction sql query tpcd benchmark data skew new algorithm performance analysis certain data set query evaluation time aggregate processing traditional parallel aggregation algorithm duplicate elimination operation traditional approach duplicate removal
