Open AccessComputer Science
A. N. Wilschut, P. Apers
1991.12.1DISTRIBUTED AND PARALLEL DATABASES
tlooto Summary
The results show that the introduced Pipelining hash-join algorithm yields a better performance for multi-join queries, and the format of the optimal join-tree appears to depend on the size of the operands.
Abstract
Abstract is not available.
Citation format
WILSCHUT, A. N.; APERS, P. Dataflow query execution in a parallel main-memory environment. DISTRIBUTED AND PARALLEL DATABASES, 1991, 1: 103–128.