Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Efficient Parallel Query Processing by Graph Ranking

Efficient Parallel Query Processing by Graph Ranking 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 worst-case performance guarantee 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 results indicate the superiority of our approach. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Fundamenta Informaticae IOS Press

Efficient Parallel Query Processing by Graph Ranking

Fundamenta Informaticae , Volume 69 (3) – Jan 1, 2006

Loading next page...
 
/lp/ios-press/efficient-parallel-query-processing-by-graph-ranking-AWokcwnYz4

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
IOS Press
Copyright
Copyright © 2006 by IOS Press, Inc
ISSN
0169-2968
eISSN
1875-8681
Publisher site
See Article on Publisher Site

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 worst-case performance guarantee 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 results indicate the superiority of our approach.

Journal

Fundamenta InformaticaeIOS Press

Published: Jan 1, 2006

There are no references for this article.