Abstract
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to Makino et al. for designing query execution plans with almost optimal number of parallel steps. This algorithm is based on the concept of edge ranking of graphs. We use a new upper bound for the edge ranking number of a tree to derive a better approximation ratio for this algorithm. We also present some experimental results obtained during the tests of the algorithm on random graphs in order to compare the quality of both approximation ratios on average. Both theoretical analysis and experimental resultss indicate the superiority of our approach.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chaudhuri, S.: An overview of query optimization in relational systems. In: Proc. PODS, Seattle (WA), USA (1998)
Dereniowski, D., Kubale, M.: Efficient parallel query processing by graph ranking, Fundamenta Informaticae (submitted)
Furer, M., Raghavachari, B.: Approximating the minimum-degree Steiner tree to within one of optimal. J. Algorithms 17, 409–423 (1994)
Ibaraki, T., Kameda, T.: On the optimal nesting order for computing N-relational joins. ACM Transactions on Database Systems 9, 482–502 (1984)
Kremer, M., Gryz, J.: A survey of query optimization in parallel databases, Technical Report CS-1999-04 York University (1999)
Lam, T.W., Yue, F.L.: Optimal edge ranking of trees in linear time. In: Proc. of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 436–445 (1998)
Lu, H., Shan, M.-C., Tan, K.-L.: Optimization of multi-way join queries for parallel execution. In: Proc. of the 17th Conference on Very Large Data Bases, Barcelona, Spain (September 1991)
Makino, K., Uno, Y., Ibaraki, T.: Minimum edge ranking spanning trees of threshold graphs. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 428–440. Springer, Heidelberg (2002)
Makino, K., Uno, Y., Ibaraki, T.: On minimum edge ranking spanning trees. J. Algorithms 38, 411–437 (2001)
de la Torre, P., Greenlaw, R., Schaffer, A.A.: Optimal edge ranking of trees in polynomial time. Algorithmica 13, 529–618 (1995)
Ullman, J.D.: Principles of Database and Knowledge-Base Systems, vol. 1. Computer Science Press, Maryland (1990)
Yu, P.S., Chen, M.-S., Wolf, J.L., Turek, J.: Parallel query processing. In: Adam, N.R., Bhargava, B.K. (eds.) Advanced Database Systems. LNCS, vol. 759, Springer, Heidelberg (1993)
Zhou, X., Kashem, M.A., Nishizeki, T.: Generalized edge-rankings of trees. In: D’Amore, F., Marchetti-Spaccamela, A., Franciosa, P.G. (eds.) WG 1996. LNCS, vol. 1197, pp. 390–404. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dereniowski, D., Kubale, M. (2006). Parallel Query Processing and Edge Ranking of Graphs. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2005. Lecture Notes in Computer Science, vol 3911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11752578_56
Download citation
DOI: https://doi.org/10.1007/11752578_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34141-3
Online ISBN: 978-3-540-34142-0
eBook Packages: Computer ScienceComputer Science (R0)