This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Join Algorithms on a Shared-Memory Multiprocessor Database Machine
November 1988 (vol. 14 no. 11)
pp. 1668-1683

The authors develop and present a large set of parallel algorithms for implementing the join operation on a shared-memory multiprocessor database machine. The development of these algorithms follows a structured approach. The major steps involved in the processing of the join operation by the machine are first identified. Then, alternative join algorithms are constructed by concatenating the different ways of performing these steps. A study of the performance of the proposed algorithms is presented. This study shows, among other things, that for a given hardware configuration there is not just one overall best performing join algorithm, but rather different algorithms score the best performance, depending on the characteristics of the data participating in the join operation.

[1] D. D. Chamberlin, A. M. Gilbert, and R. A. Yost, "A history of system-Rand SQL/data system," presented at the 7th Int. Conf. Very Large Data Bases, Cannes, France, Sept. 1981.
[2] M. Stonebraker,et al., "The design and implementation of INGRES,"ACM Trans. Database Syst., vol. 1, no. 3, Sept. 1976.
[3] G. Z. Qadah, "Database machines: A survey," inProc. Nat. Comput. Conf., 1985, pp. 211-223.
[4] E. A. Ozkarahan, S. A. Schuster, and K. C. Smith, "RAP-An associative processor for database management,"AFIPS Proc., vol. 45, pp. 379-387, 1975.
[5] J. Banerjee, D. Hsiao, and K. Kannan, "DBC-A Database computer for very large databases,"IEEE Trans. Comput., vol. C-28, pp. 414- 429, June 1979.
[6] E. Babb, "Implementing a relational database by means of specialized hardware,"ACM TODS, vol. 4, no. 1, pp. 1-29, Mar. 79.
[7] G. J. Lipovski, "Architectural feature of CASSM: A context segment sequential memory," inProc. Fifth Annu. Symp. Comput. Architecture, Palo Alto, CA, Apr. 1978, pp. 31-38.
[8] D. J. Dewitt, "DIRECT-A multiprocessor organization for supporting relational database management systems,"IEEE Trans. Comput., vol. C-28, pp. 395-408, June 1979.
[9] G. Gardarin, "An introduction to SABRE: A multimicroprocessor database machine," presented at the 6th Workshop Comput. Architecture Non-Numeric-Processing, Hyeres, France, June 1981.
[10] D. K. Hsiao and M. J. Menon, "Design and analysis of a multibackend database system for performance improvements, functionality expansion and capacity growth, Parts I and II," The Ohio State University, Columbus, OH, Tech. Reps. OSU-CISRC-TR-81-81-7 and OSU-DISRC-TR81-8, 1981.
[11] R. Epstein and P. Hawthorn, "Design decisions for the intelligent database machine," inProc. Nat. Comput. Conf., 1980, pp. 237- 241.
[12] H. Schweppe, H. Zeidler, W. Hell, H. Leilich, G. Stiege, and W. Teich, "RDBM-A dedicated multiprocessor system for database management," inAdvanced Database Architecture. Englewood Cliffs, NJ: Prentice-Hall, 1983, pp. 36-86.
[13] J. R. Goodman, "An investigation of multiprocessor structures and algorithms for database management," Electron. Res. Lab., College Eng., Univ. Calif., Berkeley, CA, Memo No. UCB/ERLM81, May 1981.
[14] M. Kisuregawaet al., "Architecture and performance of relational algebra machine GRACE," inProc. Int. Conf. Parallel Processing, 1984, pp. 241-250.
[15] G. Z. Qadah and K. B. Irani, "A database machine for very large relational databases,"IEEE Trans. Comput., vol. C-34, pp. 1015- 1025, Nov. 1985.
[16] E. F. Codd, "A relational model of data for large shared data banks,"Commun. ACM, pp. 377-387, June 1970.
[17] 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.
[18] 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.
[19] D. J. Dewitt and R. Gerber, "Multiprocessor hash-based join algorithms," inProc. 11th Int. Conf. VLDB, 1985, pp. 151-164.
[20] D. B. Friedland, "Design, analysis, and implementation of parallel external sorting algorithms," Univ. Wisconsin, Madison, WI, Comput. Sci. Tech. Rep. #464, Jan. 1982.
[21] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[22] G. Z. Qadah, "A relational databases machine: Analysis and design," Ph.D. dissertation, Dep. Elec. Comput. Eng., Univ. Michigan, Ann Arbor, MI, 1983.
[23] S. Christodoulakis, "Implications of certain assumptions in database performance evaluation,"ACM Trans. Database Syst.vol. 9, no. 2, pp. 163-186, June 1984.
[24] IBM 3380 DIRECT Access Storage Description and User's Guide, IBM Corp., IBM Doc. GA26-1664-0, File No. 51370-07, 1980.
[25] W. Feller,An Introduction to Probability and Its Application, Vol. I. New York: Wiley, 1967.

Index Terms:
parallel architectures; relational databases; performance evaluation; join algorithms; shared-memory multiprocessor database machine; parallel algorithms; parallel algorithms; parallel architectures; performance evaluation; relational databases; special purpose computers
Citation:
G.Z. Qadah, K.B. Irani, "The Join Algorithms on a Shared-Memory Multiprocessor Database Machine," IEEE Transactions on Software Engineering, vol. 14, no. 11, pp. 1668-1683, Nov. 1988, doi:10.1109/32.9054
Usage of this product signifies your acceptance of the Terms of Use.