Multi-join on parallel processors

  • Authors:
  • S. M. Deen;D. N. P. Kannangara;M. C. Taylor

  • Affiliations:
  • Department of Computer Science, University of Keele, Keele, Staffs., England;Department of Computer Science, University of Keele, Keele, Staffs., England;Department of Computer Science, University of Keele, Keele, Staffs., England

  • Venue:
  • DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

The paper describes a preliminary evaluation of some multi-join strategies and their performances on parallel hardware. The hardware used was a Sequent (under UNIX) with 11 usable processors, each with shared and private primary memory. A multi-join was broken down into a series of single joins which were then allocated to clusters, each cluster being a collection of parallel processors. The results of single joins, which were studied by both binary search and hash-merge techniques, were then further processed as necessary.The evaluation was conducted varying a number of parameters, such as cluster size, tuple size and cardinality. The comparative results were plotted. The study highlights the importance of a number of factors that influence the performance of a multi-join operation.