We then describe a heuristic for estimating the number of processors required to complete join execution in minimal time. Our simulation results indicate that these techniques are effective with respect to processor utilization and buffer requirements. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. The Design and Analysis of Computer Algorithms. A Guide to NP-Completeness.
Good Ones Are Hard to Find.
Multiprocessor Join Scheduling. In Shared-Nothing Systems. Performance Analysis of a Load Balancing Hash-Join Algorithm for a Shared Memory Multiprocessor.