DPL graphs — A powerful representation of parallel relational query execution plans
This paper presents a novel representation model of parallel relational query execution plans, called DPL graphs. This model allows to deal with any kind of parallel architecture and any kind of parallel execution strategy. Based on an analysis of execution dependencies between operators, this model allows to precisely represent communications, run-time control mechanisms, scheduling constraints or specific processing strategies (e.g. bucket processing).
Key wordsParallel query optimization parallel query execution plan scheduling graph
Unable to display preview. Download preview PDF.
- 1.Jim Gray. Parallel Database Systems Survey. In Tutorial Handouts of the 21st International Conference on Very Large Data Bases, Zürich, Switzerland, September 1995.Google Scholar
- 2.R.S.G. Lanzelotte P. Valduriez and M. ZaÏt. Industrial-Strength Parallel Query Optimization: Issues and Lessons. Information Systems — An International Journal, 1994.Google Scholar
- 3.S. Ganguly W. Hasan and R. Krishnamurthy. Query Optimization for Parallel Execution. In Proceedings of the ACM SIGMOD International Conference of Managment of Data, San Diego, California, USA, 1992.Google Scholar
- 4.G. Graefe R.L. Cole D.L. Davison W.J. McKenna and R.H. Wolniewicz. Extensible Query Optimization and Parallel Execution in Volcano, page 305. Query Processing for Advanced Database Applications. Morgan Kaufman, San Mateo, CA, 1994.Google Scholar
- 5.Goetz Graefe. Query evaluation techniques for large databases. ACM Computing Surveys, 25(2), June 1993.Google Scholar
- 6.G. von Bueltingsloewen. Optimizing SQL Queries for Parallel Execution. Master's thesis, UniversitÄt Karlsruhe, 1990.Google Scholar