New Algorithms for Parallelizing Relational Database Joins in the Presence of Data Skew

@article{Wolf1994NewAF,
  title={New Algorithms for Parallelizing Relational Database Joins in the Presence of Data Skew},
  author={Joel L. Wolf and Daniel M. Dias and Philip S. Yu and John Turek},
  journal={IEEE Trans. Knowl. Data Eng.},
  year={1994},
  volume={6},
  pages={990-997}
}
<arallel processing is an attractive option for relational database systems. As in any parallel environment, however, load balancing is a critical issue which affects overall performance. Load balancing for one common database operation in particular, the join of two relations, can be severely hampered for conventional parallel algorithms, due to a natural phenomenon known as data skew. In a pair of recent papers we described two new join algorithms designed to address the data skew problem. In… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Algorithms for parallelizing relational database joins in the presence of data skew Bounds on multiprocessing timing anomalies

  • D. Dias J.. Wolf, P. Yu, J. Turek
  • The Art of Computer Programming , Volume 3…
  • 1973

Algorithms for parallelizing relational database joins in the presence of data skew,

  • J.. Wolf, D. Dias, P. Yu, J. Turek
  • IBM RC 19236,
  • 1923

Similar Papers

Loading similar papers…