Early Grouping Gets the Skew

Abstract

We propose a new algorithm for external grouping with a large result set. Our approach handles skewed data gracefully and lowers the amount of random IO on disk considerably. In contrast to existing grouping algorithms, our new algorithm does not require the optimizer to employ complicated or error-prone procedures adjusting the parameters prior to query… (More)

Topics

19 Figures and Tables

Cite this paper

@inproceedings{Helmer2002EarlyGG, title={Early Grouping Gets the Skew}, author={Sven Helmer and Thomas Neumann and Guido Moerkotte}, year={2002} }