This Article 
 Bibliographic References 
 Add to: 
Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers
September 1989 (vol. 1 no. 3)
pp. 329-343

The authors compare the performance of two join algorithms on both cube and ring interconnections for message-based multicomputers, and investigate the effects that the number of processors and the type of interconnection scheme have on the performance. First, the parallel hybrid-hash join algorithm and the parallel join-index join algorithm for both the cube and ring connected multicomputers are presented. The performance of these algorithms is then compared through analytical cost modeling. The result shows that the join-index join algorithm gives good performance only when the join selectivity is very small, and the hybrid-hash join algorithm performs consistently well under most situations. It is shown that the cube topology yields better execution time than the same algorithm on the ring topology. Furthermore, increasing the number of processors has a more significant improvement on the execution time of the cube than for the ring configuration. The applicability of join indexes on the parallel database algorithms is also discussed.

[1] C. K. Baru and O. Frieder, "Implementing relational database operations in a cube-connected multicomputer," inProc. IEEE 3rd Int. Conf. Data Eng., Feb. 1987, pp. 36-43.
[2] C. K. Baru, O. Frieder, D. Kandlur, and M. Segal, "Join on a cube: Analysis, simulation, and implementation," inDatabase Machines and Knowledge Base Machines, M. Kitsuregawa and H. Tanaka, Eds. Boston: Kluwer, 1988, pp. 61-74.
[3] D. J. DeWitt and R. Gerber, "Multiprocessor hash-based join algorithms," inProc. 11th Int. Conf. Very Large Data Bases, 1985, pp. 151-164.
[4] D. Dewitt, R. H. Gerber, G. Graefe, M. L. Heytens, K. B. Kumar, and M. Muralikrishna, "GAMMA--A high performance dataflow database machine," inProc. 12th Int. Conf. VLDB, Kyoto, Japan, Aug. 1986, pp. 228-237.
[5] D. J. DeWittet al., "Implementation techniques for main memory databases," inProc. ACM Sigmod(Boston, MA), June 18-21, 1984, pp. 1-8.
[6] S. Fushimi, M. Kitsuregawa, and H. Tanaka, "An overview of the system software of a parallel relational database machine GRACE," inProc. Conf. Very Large Data Bases(Kyoto, Japan), Aug. 1986, pp. 209-219.
[7] J. Hayes, T. Mudge, Q. Stout, S. Colley, and J. Palmer, "Architecture of a hypercube supercomputer," inIEEE Conf. Parallel Processing, 1986, pp. 653-660.
[8] M. Kitsuregawa, H. Tanaka, and T. Moto-Oka, "Application of hash to database machine and its architecture,"New Generation Comput., vol. 1, pp. 63-74, 1983.
[9] M. Kitsuregawa, H. Tanaka, and T. Moto-Oka, "Architecture and performance of relational algebra machine GRACE," inProc. Int. Conf. Parallel Processing, Aug. 1984, pp. 241-250.
[10] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[11] B. L. Menezes, K. Thadani, A. G. Dale, and R. Jenevein, "Design of a hyperKYKLOSbased multiprocessor architecture for high-performance join operations," inDataBase Machines and Knowledge Base Machines, M. Kitsuregawa and H. Tanaka, Eds. Boston: Kluwer, 1988, pp. 75-88.
[12] M. Menon and D. Hsiao, "Design and analysis of join operations of database machine architectures," inAdvanced Database Machine Architecture, D. Hsiao, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1983, pp. 203-255.
[13] E. Omiecinski and E. Tien, "A hash-based join algorithm for a cube-connected parallel computer,"Info. Proc. Lett., vol. 30, no. 5, pp. 269-275, Mar. 1989.
[14] J. P. Richardson, H. Lu, and K. Mikkilineni, "Design and evaluation of parallel pipelined join algorithms," inProc. 1987 ACM SIGMOD Int. Conf. Management of Data, May 1987, pp. 399-409.
[15] L. D. Shapiro, "Join processing in database systems with large main memories,"ACM Trans. Database Syst., vol. 11, no. 3, pp. 239-264, Sept. 1986.
[16] D. Shaw, "Relational query processing on the NON-VON supercomputer,"Query Processing in Databse Syst., pp. 240-258, 1985.
[17] R. Shultz and L. Miller, "Tree structured multiple processor join methods," inProc. IEEE Data Eng. Conf., 1987, pp. 190-199.
[18] S. Su,Database Computers: Principles, Architectures and Techniques. New York: McGraw-Hill, 1986.
[19] S. Y. W. Su and C. K. Baru, "Dynamically partitionable multicomputers with switchable memory,"J. Parallel Distributed Comput., vol. 1, pp. 152-184, Nov. 1984.
[20] E. Tien and E. Omiecinski, "Join algorithms for a cube-connected multicomputer," Georgia Inst. Technol., Tech. Rep. GIT-ICS-87/ 37, 1987.
[21] J. Tuazon, J. Peterson, M. Pniel, and D. Leberman, "Caltech/JPL Mark II hypercube concurrent processor," inProc. IEEE Conf. Parallel Processing, 1985, pp. 666-673.
[22] P. Valduriez, "Join indices,"ACM Trans. Database Syst., vol. 12, pp. 218-246, June 1987.
[23] P. Valduriez and G. Gardarin, "Join and semi-join algorithms for a multiprocessor database machine,"ACM Trans. Database Syst., vol. 9, no. 1, pp. 133-161, 1984.
[24] S. B. Yao, "Approximating block accesses in database organizations,"Commun. ACM, vol. 20, pp. 260-261, Apr. 1977.

Index Terms:
cube connected multicomputers; has based join algorithms; index-based join algorithms; ring connected multicomputers; performance; analytical cost modeling; join selectivity; parallel database algorithms; file organisation; parallel algorithms; relational databases
E.R. Omiecinski, E.T. Lin, "Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers," IEEE Transactions on Knowledge and Data Engineering, vol. 1, no. 3, pp. 329-343, Sept. 1989, doi:10.1109/69.87979
Usage of this product signifies your acceptance of the Terms of Use.