Data skew and the scalability of parallel joins

When data are uniformly distributed, parallel join algorithms scale up well. However, scalability is curtailed by data skew-nonuniform distribution of data between processors. Investigation of this problem has been hampered by incomplete understanding of data skew as well as inadequate analytic performance models. The authors use a new model of data skew that addresses these shortcomings to examine the effects of skewed workloads on the scalability of the hybrid hash, scheduling hash, and sort-merge parallel join algorithms. Results indicate that the extent to which data skew degrades scalability varies with the join algorithm, the workload and the type of data skew. None of the three algorithms has the best scalability and response time in all cases.<
>