This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Parallel Distributive Join Algorithm for Cube-Connected Multiprocessors
February 1996 (vol. 7 no. 2)
pp. 127-137

Abstract—This paper presents a parallel distributive join algorithm for cube-connected multiprocessors. The performance analysis shows that the proposed algorithm has an almost linear speedup over the sequential distributive join algorithm [12] as the number of processors increases, and its performance is comparable to that of the parallel hybrid-hash join algorithm [13]. A big advantage of the proposed algorithm over hash-based join algorithms is that it does not have the bucket overflow problem caused by nonuniform hashing of the smaller operand relation. Moreover, the proposed algorithm can easily support the nonequijoin operation, which is very hard to implement by using hash-based join algorithms.

[1] H. Boral and D.J. DeWitt, "Database machines: An idea whose time has passed?" Proc. Int'l Workshop Database Machines, pp.166-187, 1983.
[2] K. Bratbergsengen, “Hashing Methods and Relational Algebra Operations,” Proc. Conf. Very Large Databases, 1984.
[3] S. Chung and P.B. Berra, "A database machine based on concatenated code words for very large databases," Computers for Artificial Intelligence Processing, B.W. Wah and C.V. Ramamoorthy, eds, pp.352-375. John Wiley and Sons, 1990.
[4] S.M. Chung, "Optical database machine using spatial light rebroadcasters," Proc. Int'l Parallel Processing Symp., pp.265-268, 1991.
[5] S.M. Chung, "Parallel main memory database system," Proc. ACM Symp. Applied Computing, pp.273-282, 1992.
[6] D.J. Dewitt and R. Gerber, "Multiprocessor hash-based join algorithms," Proc. Int'l Conf. VLDB, pp.151-164, 1985.
[7] G. Fox,M. Johnson,G. Lyzenga,S. Otto,J. Salmon,, and D. Walker,Solving Problems on Concurrent Processors, Vol. I: General Techniques andRegular Problems.Englewood Cliffs, N.J.: Prentice Hall 1988.
[8] O. Frieder,“Multiprocessor algorithms for relational-database operations on hypercube systems,” Computer, pp. 13-28, Nov. 1990.
[9] A.K. Garg and C.C. Gotlieb, "Order-preserving key transformations," ACM Trans. Database Systems, vol. 11, no. 2, pp. 213-234, 1986.
[10] H. Itoh, M. Abe et al., "Parallel control techniques for dedicated relational database engines," Proc. Int'l Conf. Data Eng., pp.208-215, 1987.
[11] M. Kitsuregawa, H. Tanaka, and T. Moto-Oka, "Architecture and performance of relational database machine Grace," Proc. Int'l Conf. Parallel Processing, pp.241-250, 1984.
[12] M. Negri and G. Pelagatti, “Distributive Join—A New Algorithm for Joining Relations,” ACM Trans. Database Systems, vol. 16, no. 4, 1991.
[13] E.R. Omiecinski and E.T. Lin,“Hash-based and index-based join algorithms for cube and ring connected multicomputers,” IEEE Trans. on Knowledge and Data Engineering, vol. 1, no. 3, pp. 329-343, Sept. 1989.
[14] E. Ozkarahan, Database Machines and Database Management. Prentice Hall, 1986.
[15] D. Schneider and D. DeWitt, “A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment,” ACM SIGMOD Record, vol. 18, no. 2, pp. 110-121, June 1989.
[16] M. Stonebraker, "Future trends in data base systems," Proc. Int'l Conf. Data Eng., pp. 222-231, 1988.
[17] S.Y.W. Su, Database Computers. McGraw-Hill, 1988.
[18] P. Valduriez and G. Gardarin,“Join and semijoin algorithms for a multiprocessor database machine,” ACM Trans. on Database Systems, vol. 9, no. 1, pp. 133-161, Mar. 1984.

Index Terms:
Distributive join, parallel processing, cube-connected processors, performance analysis, hashing join.
Citation:
Soon M. Chung, Jaerheen Yang, "A Parallel Distributive Join Algorithm for Cube-Connected Multiprocessors," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 2, pp. 127-137, Feb. 1996, doi:10.1109/71.485502
Usage of this product signifies your acceptance of the Terms of Use.