A Cost Model for the Estimation Query Execution Time in a Parallel Environment Supporting Pipeline

We propose a model for the estimation of query execution time in an environment supporting bushy and pipelined parallelism. We consider a parallel architecture of processes having private main memories, accessing a shared secondary storage and communicating to each other via a network. For this environment, we compute the cost of query operators when processed in isolation and when in pipeline mode. WE use those formulae to incrementally compute the cost of a query execution plan from its components. Our cost model can be incorporated to any optimizer for parallel query processing that considers parallel and pipelined execution of the query operators.

[1]  Yannis E. Ioannidis,et al.  Randomized algorithms for optimizing large join queries , 1990, SIGMOD '90.

[2]  Leonard D. Shapiro,et al.  Join processing in database systems with large main memories , 1986, TODS.

[3]  Edward Omiecinski,et al.  Large Join Optimization on a Hypercube Multiprocessor , 1994, IEEE Trans. Knowl. Data Eng..

[4]  Myra Spiliopoulou,et al.  Parallel Optimization of Large Join Queries with Set Operators and Aggregates in a Parallel Environment Supporting Pipeline , 1996, IEEE Trans. Knowl. Data Eng..

[5]  Rajeev Motwani,et al.  Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism , 1994, VLDB.

[6]  Donovan A. Schneider,et al.  The Gamma Database Machine Project , 1990, IEEE Trans. Knowl. Data Eng..

[7]  Won Kim,et al.  On optimizing an SQL-like nested query , 1982, TODS.

[8]  Kian-Lee Tan,et al.  Multi-Join Optimization for Symmetric Multiprocessors , 1993, VLDB.

[9]  Patrick Valduriez,et al.  On the Effectiveness of Optimization Search Strategies for Parallel Execution Spaces , 1993, VLDB.

[10]  Philip S. Yu,et al.  Scheduling and processor allocation for parallel execution of multijoin queries , 1992, [1992] Eighth International Conference on Data Engineering.

[11]  Wei Hong,et al.  Exploiting inter-operation parallelism in XPRS , 1992, SIGMOD '92.

[12]  Patricia G. Selinger,et al.  Access path selection in a relational database management system , 1979, SIGMOD '79.

[13]  Yannis E. Ioannidis,et al.  Left-deep vs. bushy trees: an analysis of strategy spaces and its implications for query optimization , 1991, SIGMOD '91.

[14]  David J. DeWitt,et al.  Complex query processing in multiprocessor database machines , 1990 .

[15]  Goetz Graefe,et al.  Query evaluation techniques for large databases , 1993, CSUR.

[16]  C. J. Date.  A Guide to the SQL Standard , 1987 .

[17]  Dean Daniels,et al.  Query Processing in R* , 1985, Query Processing in Database Systems.

[18]  Guido Moerkotte,et al.  Optimizing Join Orders , 1993 .

[19]  Arun N. Swami,et al.  Optimization of large join queries , 1988, SIGMOD '88.