A graph-theoretic model for optimizing queries involving methods

  • Authors:

  • Chiang Lee;Chi-Sheng Shih;Yaw-Huei Chen

  • Affiliations:

  • Institute of Information Engineering, National Cheng Kung University, Tainan, Taiwan/ E-mail: leec@dblab.iie.ncku.edu.tw;Institute of Information Engineering, National Cheng Kung University, Tainan, Taiwan/ E-mail: leec@dblab.iie.ncku.edu.tw;Institute of Computer Science and Information Engineering, National Chiayi University, Chiayi, Taiwan/ E-mail: ychen@sun11.ncytc.edu.tw

  • Venue:
  • The VLDB Journal — The International Journal on Very Large Data Bases
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Traditional algorithms for optimizing the execution order of joins are no more valid when selections and projections involve methods and become very expensive operations. Selections and projections could be even more costly than joins such that they are pulled above joins, rather than pushed down in a query tree. In this paper, we take a fundamental look at how to approach query optimization from a top-down design perspective, rather than trying to force one model to fit into another. We present a graph model which is designed to characterize execution plans. Each edge and each vertex of the graph is assigned a weight to model execution plans. We also design algorithms that use these weights to optimize the execution order of operations. A cost model of these algorithms is developed. Experiments are conducted on the basis of this cost model. The results show that our algorithms are superior to similar work proposed in the literature.