@inproceedings{16de8875ea63471596dc1851169954fb,
title = "Dataflow Query Execution in a Parallel Main-Memory Environment",
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",
keywords = "IR-19244, METIS-119767, DB-PDB: PARALLEL DATABASES, EWI-6333",
author = "A.N. Wilschut and Apers, {Peter M.G.}",
note = "Imported from EWI/DB PMS [db-utwente:arti:0000002032]; null ; Conference date: 01-01-1991 Through 01-01-1991",
year = "1991",
month = dec,
doi = "10.1109/PDIS.1991.183069",
language = "Undefined",
isbn = "0-8186-2295-4",
publisher = "IEEE Computer Society",
pages = "68--77",
booktitle = "Proceedings of the First International Conference on Parallel and Distributed Information Systems (PDIS 1991)",
address = "United States",
}