Workload balance and page access scheduling for parallel joins in shared-nothing systems

A methodology to resolve balancing and scheduling issues for parallel join execution in a shared-nothing multiprocessor environment are presented. In the past, research on parallel join methods focused on the design of algorithms for partitioning relations and distributing data buckets as evenly as possible to the processors. Once data are uniformly distributed to the processors, it is assumed that all processors will complete their tasks at about the same time. The authors stress that this is true if no further information, such as page-level join index, is available. Otherwise, the join execution can be further optimized and the workload in the processors may still be unbalanced. The authors study these problems in a shared-nothing environment