Parallel algorithms for the execution of relational database operations

This paper presents and analyzes algorithms for parallel processing of relational database operations in a general multiprocessor framework. To analyze alternative algorithms, we introduce an analysis methodology which incorporates I/O, CPU, and message costs and which can be adjusted to fit different multiprocessor architectures. Algorithms are presented and analyzed for sorting, projection, and join operations. While some of these algorithms have been presented and analyzed previously, we have generalized each in order to handle the case where the number of pages is significantly larger than the number of processors. In addition, we present and analyze algorithms for the parallel execution of update and aggregate operations.

[1]  Gérard M. Baudet,et al.  Optimal Sorting Algorithms for Parallel Computers , 1978, IEEE Transactions on Computers.

[2]  Polly Siegel,et al.  INGRES Version 6.2 Reference Manual. , 1979 .

[3]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[4]  Chyuan Shiun Lin,et al.  The design of a rotating associative memory for relational database applications , 1976, TODS.

[5]  Edward Babb,et al.  Implementing a relational database by means of specialzed hardware , 1979, TODS.

[6]  Jayanta Banerjee,et al.  Concepts and capabilities of a database computer\ , 1978, TODS.

[7]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[8]  David J. DeWitt,et al.  DIRECT - A Multiprocessor Organization for Supporting Relational Database Management Systems , 1979, IEEE Trans. Computers.

[9]  Daniel L. Slotnick.  Logic per Track Devices , 1970, Adv. Comput..

[10]  David J. DeWitt,et al.  A PERFORMANCE EVALUATION OF DATABASE MACHINE ARCHITECTURES , 1981 .

[11]  Kenneth C. Smith,et al.  RAP: an associative processor for data base management , 1975, AFIPS '75.

[12]  Dina Bitton Friedland.  Design, analysis, and implementation of parallel external sorting algorithms , 1981 .

[13]  David J. DeWitt,et al.  Design considerations for data-flow database machines , 1980, SIGMOD '80.

[14]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1976, STOC '76.

[15]  D. J. De Witt,et al.  Direct—A Multiprocessor Organization for Supporting Relational Database Management Systems , 1979 .

[16]  G. Jack Lipovski,et al.  CASSM: a cellular system for very large data bases , 1975, VLDB '75.