Scheduling Queries For Parallel Execution On Multicomputer Database Management System

In this paper, we investigate two scheduling approaches for multicomputer-based parallel database systems: the competition-based technique allows queries to compete freely for computing resources, while the planning-based scheme relies on a centralized scheduler to plan We execution of all queries. Our studies show that competition-based though provides impressive performance, the planning-based is consistently the better approach