ResearchIndex Home J. L. Wolf, D. M. Dias, P. S. Yu, An Effective Algorithm for Parallelizing Sort Merge Joins in the Presence of Data Skew , Proceedings of Parbase 90, 1990.
Skewed data can make equal work assignment a more difficult task.
J. L. Wolf, D. M. Dias, P. S. Yu, An Effective Algorithm for Parallelizing Sort Merge Joins in the Presence of Data Skew , Proceedings of Parbase 90, 1990. In these cases no algorithm is known to speedup or scaleup. The hash join example shows that new parallel algorithms can improve the performance of relational operators. Even though parallelism can be obtained from conventional sequential relational algorithms by using split and merge operators, we expect that many new algorithms will be discovered in the future. The State of the Art 3.1.