Optimization of Parallel Query Execution Plans in XPRS

W. Hong and Michael Stonebraker

EECS Department
University of California, Berkeley
Technical Report No. UCB/ERL M91/50
May 1991

http://www2.eecs.berkeley.edu/Pubs/TechRpts/1991/ERL-91-50.pdf

In this paper, we describe our approach to the optimization of query execution plans in XPRS, a multi-user parallel database machine based on a shared-memory multiprocessor and a disk array. The main difficulties in this optimization problem are the compile-time unknown parameters such as available buffer size and number of free processors, and the enormous search space of possible parallel plans. We deal with these problems with a novel two phase optimization strategy which dramatically reduces the search space and allows run time parameters without significantly compromising plan optimality. In this paper we present our two phase strategy and give experimental evidence from XPRS benchmarks that indicate that it almost always produces optimal plans.

BibTeX citation:

@techreport{Hong:M91/50,
    Author = {Hong, W. and Stonebraker, Michael},
    Title = {Optimization of Parallel Query Execution Plans in XPRS},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1991},
    Month = {May},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1991/1767.html},
    Number = {UCB/ERL M91/50},
    Abstract = {In this paper, we describe our approach to the optimization of query execution plans in XPRS, a multi-user parallel database machine based on a shared-memory multiprocessor and a disk array. The main difficulties in this optimization problem are the compile-time unknown parameters such as available buffer size and number of free processors, and the enormous search space of possible parallel plans. We deal with these problems with a novel two phase optimization strategy which dramatically reduces the search space and allows run time parameters without significantly compromising plan optimality. In this paper we present our two phase strategy and give experimental evidence from XPRS benchmarks that indicate that it almost always produces optimal plans.}
}

EndNote citation:

%0 Report
%A Hong, W.
%A Stonebraker, Michael
%T Optimization of Parallel Query Execution Plans in XPRS
%I EECS Department, University of California, Berkeley
%D 1991
%@ UCB/ERL M91/50
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1991/1767.html
%F Hong:M91/50