This Article 
 Bibliographic References 
 Add to: 
Parallel Hash-Based Join Algorithms for a Shared-Everything Environment
October 1994 (vol. 6 no. 5)
pp. 750-763

Analyzes the costs, and describes the implementation, of three hash-based join algorithms for a general purpose shared-memory multiprocessor. The three algorithms considered are the hashed loops, GRACE and hybrid algorithms. We also describe the results of a set of experiments that validate the cost models presented and demonstrate the relative performance of the three algorithms.

[1] D. Bittonet al., "Parallel algorithms for the execution of relational database operation,"ACM Trans. Database Syst., vol. 8, no. 3, pp. 324-353, Sept. 1983.
[2] D. Bitton, D. J. DeWitt, and C. Turbyfill, "Benchmarking database systems--A systematic approach," inProc. 1983 Very Large Data-base conf., Oct. 1983.
[3] K. Bratbergsengen, "Hashing methods and relational algebra operations," inProc. Conf. Very Large Data Bases(Singapore), Aug. 1984, pp. 323-333.
[4] B. C. Brookes, "Bradford's Law and the bibliography of science,"Nature, vol. 224, no. 5223, pp. 953-956, 1969.
[5] P. A. Buhr and R. A. Stroobosscher, "Theµsystem: Providing light-weight concurrency on shared-memory multiprocessor computers running UNIX,"Software: Practice and Experience, vol. 20, pp. 929-963, Sept. 1990.
[6] D. J. DeWittet al., "Implementation techniques for main memory databases," inProc. ACM Sigmod(Boston, MA), June 18-21, 1984, pp. 1-8.
[7] D. J. DeWitt and R. Gerber, "Multiprocessor hash-based join algorithms,"Proc. 11th Int. Conf. Very Large Data Bases, 1985.
[8] G. Graefe, "Encapsulation of parallelism in the Volcano query processing system," inProc. ACM SIGMOD Conf., Atlantic City, NJ, May 1990, p. 102.
[9] M. Kitsuregawa, H. Tanaka, and T. Moto-oka, "Application of hash to data base machine and its architecture,"New Generation Computing, vol. 1, pp. 63-74, 1983.
[10] P.-A. Larson, "The data model and query language of LauRel,"IEEE Database Eng., vol. 11, no. 3, (Special Issue on Nested Relations), 1988.
[11] H. Lu, K. Tan, and M. Shan, "Hash-based join algorithms for multiprocessor computers with shared memory,"Proc. 16th Int. Conf. Very Large Data Bases, 1990, pp. 198-209.
[12] E. R. Omiencinski and E. T. Lin, "Hash-based and index-based join algorithms for cube and ring connected multicomputers,"IEEE Trans. Knowl. Data Eng., vol. 1, pp. 329-343, Sept. 1989.
[13] H. Pirahesh, C. Mohan, J. Cheng, T. S. Liu, and P. Selinger, "Parallelism in relational data base systems: architectural issues and design approaches,"Proc. 2nd Int. Symp. Databases in Parallel and Distrib. Syst., Dublin, July 1990.
[14] Q. Z. Qadah and K. B. Irani, "The join algorithms on a shared-memory multiprocessor database machine,"IEEE Trans. Software Eng., vol. 14, pp. 1668-1683, Nov. 1988.
[15] 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.
[16] D. Schneider and D. Dewitt, "A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment," inProc. ACM SIGMOD Conf.(Portland, OR), May-June 1989, p. 110.
[17] Sequent Computer Systems, "Symmetry technical summary," 1987.
[18] A. Osterhaug, "Sequent computer systems," inGuide to Parallel Programming on Sequent Computer Systems, 2nd Ed. Englewood Cliffs, NJ: Prentice-Hall, 1989.
[19] 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.
[20] 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.
[21] S. B. Yao, "Approximating block accesses in database organizations,"Commun. ACM, vol. 20, pp. 260-261, Apr. 1977.

Index Terms:
query processing; relational databases; database theory; shared memory systems; performance evaluation; parallel algorithms; parallel hash-based join algorithms; shared-everything environment; general purpose shared-memory multiprocessor; hashed loops algorithm; GRACE algorithm; hybrid algorithm; cost models; algorithm performance; relational database; query processing
T.P. Martin, P.-Å. Larson, V. Deshpande, "Parallel Hash-Based Join Algorithms for a Shared-Everything Environment," IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 5, pp. 750-763, Oct. 1994, doi:10.1109/69.317705
Usage of this product signifies your acceptance of the Terms of Use.