Parallelism in a Main-Memory DBMS: The Performance of PRISMA/DB

his paper evaluates the performance of the parallel, main-memory DBMS, PRISMA/DB. First, an abstract architecture for parallel query execution is presented. A performance model for the execution of simple relational operations on this architecture is developed. The parameters in the model are set using experiments on PRISMA/DB and the performance of PRISMA/DB is analized in the context of the model. Several conclusions can be drawn from the model combined with the results of the performance experiments. Firstly, the performance of PRISMA/DB appears to be competitive with respect toother systems. Secondly, the developed model can explain the results from the performance experiments to a large extent. Also, it is concluded that observed linear speedup for small numbers of processors cannot always be extrapolated to larger numbers of processors. Finally, it is concluded that the optimal number of processors for the parallelexecution of an operation is smaller for a main- memory system than for a disk -based system. The results of this study can be used to design data fragmentation strategies for large parallel machines.

[1]  Peter M. G. Apers,et al.  Algebraic optimization of recursive queries , 1992, Data Knowl. Eng..

[2]  Zarka Cvetanovic,et al.  The Effects of Problem Partitioning, Allocation, and Granularity on the Performance of Multiple-Processor Systems , 1987, IEEE Transactions on Computers.

[3]  Haran Boral,et al.  Proceedings of the Sixth International Workshop on Database Machines , 1989 .

[4]  Paul W. P. J. Grefen,et al.  PRISMA/DB: A Parallel Main Memory Relational DBMS , 1992, IEEE Trans. Knowl. Data Eng..

[5]  Kjell Bratbergsengen,et al.  The Development of the CROSS8 and HC16-186 Parallel (Database) Computers , 1989, IWDM.

[6]  Peter M. G. Apers,et al.  Processing Recursive Queries in Relational Algebra , 1986, DS-2.

[7]  Patrick Valduriez,et al.  Prototyping Bubba, A Highly Parallel Database System , 1990, IEEE Trans. Knowl. Data Eng..

[8]  Michael Stonebraker,et al.  Implementation techniques for main memory database systems , 1984, SIGMOD '84.

[9]  Peter M. G. Apers,et al.  Pipelining in query execution , 1990, Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications.

[10]  Donovan A. Schneider,et al.  The Gamma Database Machine Project , 1990, IEEE Trans. Knowl. Data Eng..

[11]  Stefano Ceri,et al.  Distributed Databases: Principles and Systems , 1984 .

[12]  Tom W. Keller,et al.  Data placement in Bubba , 1988, SIGMOD '88.

[13]  J. van der Spek.  POOL-X and its Implementation , 1990, PRISMA Workshop.

[14]  Michael J. Carey,et al.  Query processing in main memory database management systems , 1986, SIGMOD '86.

[15]  David J. DeWitt,et al.  A Single User Evaluation of the Gamma Database Machine , 1987, IWDM.

[16]  Paul W. P. J. Grefen,et al.  Parallel handling of integrity constraints on fragmented relations , 1990, DPDS '90.

[17]  William D. Roome,et al.  The Silicon Database Machine: Rationale, Design, and Results , 1987, IWDM.

[18]  A. N. Wilschut,et al.  Dataflow query execution in a parallel main-memory environment , 1991, [1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems.

[19]  Stefano Ceri,et al.  Distributed Transitive Closure Computations: The Disconnection Set Approach , 1990, VLDB.

[20]  Margaret H. Eich,et al.  Main memory database research directions , 1989 .

[21]  David J. DeWitt,et al.  Benchmarking Database Systems A Systematic Approach , 1983, VLDB.