Abstract
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).
Chapter PDF
References
Jim Gray. Parallel Database Systems Survey. In Tutorial Handouts of the 21st International Conference on Very Large Data Bases, Zürich, Switzerland, September 1995.
R.S.G. Lanzelotte P. Valduriez and M. ZaÏt. Industrial-Strength Parallel Query Optimization: Issues and Lessons. Information Systems — An International Journal, 1994.
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.
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.
Goetz Graefe. Query evaluation techniques for large databases. ACM Computing Surveys, 25(2), June 1993.
G. von Bueltingsloewen. Optimizing SQL Queries for Parallel Execution. Master's thesis, UniversitÄt Karlsruhe, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brunie, L., Kosch, H. (1996). DPL graphs — A powerful representation of parallel relational query execution plans. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024791
Download citation
DOI: https://doi.org/10.1007/BFb0024791
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61627-6
Online ISBN: 978-3-540-70636-6
eBook Packages: Springer Book Archive