Dataflow Query Execution in a Parallel Main-Memory Environment (1991)
| Venue: | Distributed and Parallel Databases |
| Citations: | 159 - 4 self |
BibTeX
@INPROCEEDINGS{Wilschut91dataflowquery,
author = {Annita N. Wilschut and Peter M. G. Apers},
title = {Dataflow Query Execution in a Parallel Main-Memory Environment},
booktitle = {Distributed and Parallel Databases},
year = {1991},
pages = {68--77}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, the performance and characteristics of the execution of various join-trees on a parallel DBMS are studied. The results of this study, are a step into the direction of the design of a query optimization strategy that is fit for parallel execution of complex queries. Among others, synchronization issues are identified to limit the performance gain from parallelism. A new hashjoin algorithm, called Pipelining hash-join is introduced that has fewer synchronization constraints than the known hash-join algorithms. Also, the behavior of individual join operations in a join-tree is studied in a simulation experiment. The results show that the Pipelining hash-join algorithm yields a better performance for multi-join queries. Also, the format of the optimal join-tree appears to depend on the size of the operands of the join: A multi-join between small operands performs best with a bushy schedule; larger operands are better off with a linear schedule. The results from the simulatio...
