There has been much research into parallel database query processing. In this paper, we focus on several techniques for query optimization in shared-nothing parallel database systems. We examine several methods of searching for optimal query execution plans, cost models, and processor allocation algorithms. We also review static and dynamic load balancing techniques.

A survey of the proposed methods reveals their pros and cons. Taking advantage of strengths and eliminating weaknesses is the goal in implementing an algorithm. We describe a design method which fits each algorithm to the environment it is best suited for.

Download paper in PDF format.

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.