Parallel Query Processing and Edge Ranking of Graphs
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.
Unable to display preview. Download preview PDF.
- 1.Chaudhuri, S.: An overview of query optimization in relational systems. In: Proc. PODS, Seattle (WA), USA (1998)Google Scholar
- 2.Dereniowski, D., Kubale, M.: Efficient parallel query processing by graph ranking, Fundamenta Informaticae (submitted)Google Scholar
- 5.Kremer, M., Gryz, J.: A survey of query optimization in parallel databases, Technical Report CS-1999-04 York University (1999)Google Scholar
- 6.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)Google Scholar
- 7.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)Google Scholar
- 11.Ullman, J.D.: Principles of Database and Knowledge-Base Systems, vol. 1. Computer Science Press, Maryland (1990)Google Scholar