Abstract
In this paper, we describe an approach to determine parallel scheduling for extended SQL query operations [12]. The parallelization strategy generate a parallel program which includes the pipeline and partition parallelism taking into account resource contention. Performance evaluation shows the efficiency of each type of parallelism as a function of number of processors. The main contributions of this work is the consideration of all search spaces (left-deep trees, right-deep trees and bushy trees).
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
F. Bancilhon, R. Ramakrishnan, “An Amateur's Introduction to Recursive Query Processing Strategies”, Proc. of ACM-SIGMOD, W.D.C., May 1986, pp. 16–52.
C. Beeri, R. Ramakrishnan, “On the Power of Magic”, Proc of the ACM SIGMOD Symposium on Principles of Database Systems, 1987, pp.269–283.
D. Bitton et al., “Benchmarking Database Systems — a Systematic Approach”, Proc. of the 1983 VLDB conf., Oct. 1983, pp. 8–19.
H. Boral et al., “Prototyping Bubba, a Highly Parallel Database System”, IEEE TKDE. Vol. 1, No. 1, March 1990, pp. 4–24.
M.S. Chen et al., “Scheduling and Processor Allocation for Parallel Execution of Multi-Join Queries”, 8th Int. Conf. on Data Eng., Tempe, Feb. 1992, pp. 58–67.
M.S. Chen et al., “Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins”, 18th Int. Conf. VLDB, Vancouver, Aug. 1992, pp. 15–26.
M.S. Chen et al., “Applying Hash Filters to Improving the Execution of Bushy Trees”, Proceedings of the 19th VLDB Conf., Dublin, August 1993, pp. 505–516.
E.G. Coffman, et al., “Operating Systems Theory”, Prentice-Hall, 1973.
R.W. Conway, et al., “The Theory of Scheduling”, Addition-wesley, 1967.
D.J. Dewitt et al., “The Gamma Database Machine Project”, IEEE TKDE. Vol. 2, No. 1, March 1990, pp. 44–61.
D.J. Dewitt, J. Gray, “Parallel Database Systems: The Future of High Performance Database Systems”, Com. of the ACM, Vol. 35, No. 6, June 1992, pp. 85–98.
G. Gardarin, P. Valduriez, “ESQL2: An Object-Oriented SQL with F-Logic Semantcis”, IEEE Int. conf. on Data Eng., Phoenix, Feb. 1992, pp. 320–327.
A. Hameurlain, F. Morvan, “An Algorithm For Selection Operator Propagation in Resolution Graph”, Intl. Conf. DEXA'90, Vienna, Aug. 1990, pp. 550–553.
A. Hameurlain, F. Morvan, “Parallel Deductive Databases: Design and Implementation of a Parallel Algorithm for Computing Recursive Queries”, 9th Conf. Distributed Appli. and Multiprocessor Technology, CA, Dec. 1991, pp. 181–189.
A. Hameurlain et al., “An Analytical Method to Allocate Processors in High Performance Parallel Execution of Recursive Queries”, Intl. Conf. DEXA'92, Valencia, Sept. 1992, Spring Verlag, pp. 44–47.
A. Hameurlain, F. Morvan, “A Parallel Scheduling Method for Efficient Query Processing”, 22nd Intl. Conf. on Parallel Processing, St. Charles IL., Aug. 1993, Vol. 3, pp. 258–261.
A. Hameurlain, F. Morvan, “An Optimization Method of Data Communication and Control for Parallel Execution of SQL Queries”, Intl. Conf. DEXA'93, LNCS 720, Prague, Sept. 1993, pp. 301–312
W. Hong, M. Stonebraker, “Optimization of Parallel Query Execution Plans in XPRS”, First Intl. Conf. on Parallel Distributed Information Systems, Dec. 91 Florida, pp. 218–225.
W. Hong, “Exploiting Inter-Operation Parallelism in XPRS”, ACM SIGMOD Intl. Conf. on Management of Data, USA, June 1992, pp. 19–28.
M. A. W. Houtsma, et al., “Implementation and Performance Evaluation of a Parallel Transitive Closure Algorithm on PRISMA/DB”, Proc. of the 19th VLDB Conf., Dublin 1993, pp. 206–217.
D. Schneider, D. Dewitt, “A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment”, Proc. of the ACM SIGMOD Conf., 1989, pp. 110–121.
D. Schneider, D. Dewitt, “Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines”, Proc. of the16th VLDB Conf., Brisbane, Australia 1990, pp. 469–480.
E. J. Shekita et al., “Multi-Join Optimization for Symmetric Multiprocessors”, Proceedings of the 19th VLDB Conf., Dublin, Aug. 1993, pp. 479–492.
M. Stonebraker, et. al, “The Design of XPRS”, 14th Intl. Conf. VLDB, 1988.
P. Valduriez, S. Khoshafian, “Parallel Evaluation of the Transitive Closure of a Database Relation”, Intl. Jo. of Parallel Programming, Vol. 17, No. 1, Feb. 1988.
M. Ziane et al., “Parallel Query Processing in DBS3”, 2nd Int. Conf. on Parallel and Distribued Information Systems, San Diego, Jan. 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hameurlain, A., Morvan, F. (1994). Exploiting inter-operation parallelism for SQL query optimization. In: Karagiannis, D. (eds) Database and Expert Systems Applications. DEXA 1994. Lecture Notes in Computer Science, vol 856. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58435-8_242
Download citation
DOI: https://doi.org/10.1007/3-540-58435-8_242
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58435-3
Online ISBN: 978-3-540-48796-8
eBook Packages: Springer Book Archive