A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Automated partitioning design in parallel database systems
2011
Proceedings of the 2011 international conference on Management of data - SIGMOD '11
In recent years, Massively Parallel Processors (MPPs) have gained ground enabling vast amounts of data processing. In such environments, data is partitioned across multiple compute nodes, which results in dramatic performance improvements during parallel query execution. To evaluate certain relational operators in a query correctly, data sometimes needs to be re-partitioned (i.e., moved) across compute nodes. Since data movement operations are much more expensive than relational operations, it
doi:10.1145/1989323.1989444
dblp:conf/sigmod/NehmeB11
fatcat:2ah4vpgen5h65brpogj4wttohq