Scheduling of query execution plans in symmetric multiprocessor database systems

Summary form only given. While excellent research results have been proposed for query optimization, little work has been done for the scheduling of query execution plans. We target the optimization problem of the schedule lengths of query execution plans in a symmetric multiprocessor (SMP) database system. We show the NP-hardness of the optimization problem. A critical-path-based algorithm is proposed to minimize the schedule length of a collection of query execution plans. When each query execution plan has a tree or a directed acyclic graph structure, we show that the approximation ratios of our proposed algorithm are 2 and (3 - 2/M), respectively, where M is the number of processors in the system. When the proposed algorithm is adopted for online usages, the competitive ratio of the algorithm is proven being (3 $2/M). The proposed algorithm is optimal when there is a sufficient number of processors. The performance of the proposed algorithm is evaluated based on the TPC-C benchmark.