article · ACM SIGMOD Record · 1995
Adaptive parallel aggregation algorithms
Ambuj Shatdal, Jeffrey F. Naughton
Cited by 20Open access
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.
Cite this paper
Shatdal, A., & Naughton, J. F. (1995). Adaptive parallel aggregation algorithms. ACM SIGMOD Record, 24(2), 104–114. https://doi.org/10.1145/568271.223801
Shatdal, Ambuj, and Jeffrey F. Naughton. “Adaptive parallel aggregation algorithms.” ACM SIGMOD Record, vol. 24, no. 2, 1995, pp. 104–14, https://doi.org/10.1145/568271.223801.
Shatdal, Ambuj, and Jeffrey F. Naughton. 1995. “Adaptive parallel aggregation algorithms.” ACM SIGMOD Record 24 (2): 104–14. https://doi.org/10.1145/568271.223801.
Shatdal, A. and Naughton, J.F. (1995) ‘Adaptive parallel aggregation algorithms’, ACM SIGMOD Record, 24(2), pp. 104–114. Available at: https://doi.org/10.1145/568271.223801.
@article{shatdal1995adaptive,
title = {{Adaptive parallel aggregation algorithms}},
author = {Shatdal, Ambuj and Naughton, Jeffrey F.},
journal = {ACM SIGMOD Record},
volume = {24},
number = {2},
pages = {104--114},
year = {1995},
doi = {10.1145/568271.223801}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.