Optimal Splitters for Database Partitioning with Size Bounds

Kenneth A. Ross & John Cieslewicz
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (or balanced) parallel subtasks. In this paper, we aim to find, materialize and maintain a set of partitioning elements (splitters) for a data set. Unlike traditional partitioning elements, our splitters define both inequality and equality partitions, which allows us to bound the size of the inequality partitions. We provide an algorithm for...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.