Abstract
The performance and characteristics of the execution of various join-trees on a parallel DBMS are studied. The results are a step in 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 hash-join 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. The results from the simulation study are confirmed with an analytic model for dataflow query execution
| Original language | Undefined |
|---|---|
| Title of host publication | Proceedings of the First International Conference on Parallel and Distributed Information Systems (PDIS 1991) |
| Place of Publication | Los Alamitos |
| Publisher | IEEE Computer Society |
| Pages | 68-77 |
| Number of pages | 10 |
| ISBN (Print) | 0-8186-2295-4 |
| DOIs | |
| Publication status | Published - Dec 1991 |
Publication series
| Name | |
|---|---|
| Publisher | IEEE |
Keywords
- IR-19244
- METIS-119767
- DB-PDB: PARALLEL DATABASES
- EWI-6333
Cite this
Wilschut, A. N., & Apers, P. M. G. (1991). Dataflow Query Execution in a Parallel Main-Memory Environment. In Proceedings of the First International Conference on Parallel and Distributed Information Systems (PDIS 1991) (pp. 68-77). Los Alamitos: IEEE Computer Society. https://doi.org/10.1109/PDIS.1991.183069