Comments on "Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers"

  • Authors:

  • J. -Y. Tien;W. -P. Yang

  • Affiliations:

  • -;-

  • Venue:
  • IEEE Transactions on Knowledge and Data Engineering
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract

The cost distributions of both the parallel hybrid-hash join and the parallel join-index join algorithms proposed in the above-named work are presented in more detail. The result shows that almost the entire relation may need to be retrieved from disk, though the join selectivity is low. A table of semi-join selectives and cube sizes is given to show the condition that the join-index method performs better than the hybrid-hash method, i.e., the really low selectivity for the join-index method. An error in one of the cost formulas is corrected, and a more efficient method on the final join in the join-index method is proposed.