Abstract
The problem of finding an optimal global plan for a tree query in a distributed database is studied under the objective of total processing time minimization. A two-step pruning algorithm based on dynamic programming is presented. This algorithm performs a pruning step twice for each subquery by designing two separate equivalence criteria applicable to each subquery. This lessens the search work done by the optimizer considerably. Without losing optimality, the search space for finding the optimum is reduced by aggregating partial plans that always incur the same processing time into a single plan and eliminating partial plans that can never be the optimum.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Apers, P., Hevner, A., and Yao, S.B., “Optimization algorithm for distributed queries”, IEEE Trans. Software Engineering, SE-9, No.1, Jan. 1983, pp.57–68.
Bernstein, P.A., Goodman, N., Wong, E., Reeve, C.L., and Rothnie, Jr., J.B., “Query Processing in a System for Distributed Databases (SDD-1)”, ACM Trans. Database Systems, Vol.6, No.4, Dec. 1981, pp.602–625.
Chiu, D-M, Bernstein, P. and Ho, Y-C., “Optimizing chain queries in a distributed database system”, SIAM Journal of Computing, Vol.13, No.1, Feb., 1984, pp. 116–134.
Graham, R.L., Knuth, D.E., and Patashnik, O., Concrete Mathematics, Addison-Wesley Publishing Company, Inc., 1989, pp. 165–166.
Hevner, A.R., and Yao, S.B., “Querying Distributed Databases on Local Area Networks”, Proceedings of The IEEE, Vol.75, No.5, May 1987, pp.563–572.
Horowitz, E., Sahni, S., Fundamentals of Computer Algorithms, Computer Science Press, Inc., 1978, pp. 198–202.
Ioannidis, Y.E., Kang, Y.C., “Left-deep vs. bushy trees: An analysis of strategy spaces and its implications for query optimization”, Proc. ACM SIGMOD, May 1991, pp. 168–177.
Kim, H., Lee, S., Kim, H.-J., “Two-step pruning algorithm for distributed query optimization”, Technical report DBTR-95-1, 1995.
Lafortune, S., and Wong, E., “A state transition model for distributed query processing”, ACM Transactions on Database Systems, Vol.11, No.3, Sep. 1986, pp.294–322.
Lohman, G.M., Mohan, C., Haas, L.M., Lindsay, B.G., Selinger, P.G., Wilms, P.F., “Query processing in R*”, IBM Research Report RJ4272, San Jose, Calif., April 1984.
Mackert, L.M., Lohman, G.M., “R* optimizer validation and performance evaluation for distributed queries”, Proc. VLDB, August 1986, pp.149–159.
Ono, K. and Lohman, G.M., “Measuring the complexity of join enumeration in query optimization”, Proc. VLDB, August 1990, pp.314–325.
Ozsu, M.T., and Valduriez, P., Principle of Distributed Database Systems, Prentice-Hall International, Inc., 1991, pp.230–252.
Tsang, A., Olschanowsky, M., “A study of Database 2 customer queries”, Technical Report 03.413, IBM Santa Teresa Laboratory, April 1991.
Yu, C.T., “Optimization of distributed tree query”, Journal of Computer and System Science, Academic Press, Inc., Vol.29, 1984, pp.409–445.
Yu, C.T. and Chang C.C., “Distributed query processing”, ACM Computing Surveys, Vol.16, No.4, Dec, 1984, pp.399–432.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, H., Lee, S., Kim, H.J. (1995). Two-step pruning: A distributed query optimization algorithm. In: Goble, C., Keane, J. (eds) Advances in Databases. BNCOD 1995. Lecture Notes in Computer Science, vol 940. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000548
Download citation
DOI: https://doi.org/10.1007/BFb0000548
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60100-5
Online ISBN: 978-3-540-49427-0
eBook Packages: Springer Book Archive