An Algorithm to Allocate Processors among Bush Tree to Get Multiple Pipelined Parallel Execution on Hash Join
DOI:
CSTR:
Author:
Affiliation:
Clc Number:
Fund Project:
Article
|
Figures
|
Metrics
|
Reference
|
Related
|
Cited by
|
Materials
|
Comments
Abstract:
An algorithm on how to allocate processors for bush query tree to get multiple pipelined parallel execution with hash join is presented in this paper. An example is given for further description.
