The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - September (1991 vol.3)
pp: 387-389
ABSTRACT
<p>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.</p>
INDEX TERMS
cube connected multicomputers; index-based join algorithms; ring connected multicomputers; parallel hybrid-hash join; parallel join-index join algorithms; semi-join selectives; cube sizes; database theory; distributed databases; indexing
CITATION
J.-Y. Tien, W.-P. Yang, "Comments on "Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers"", IEEE Transactions on Knowledge & Data Engineering, vol.3, no. 3, pp. 387-389, September 1991, doi:10.1109/69.91050
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool