Evolution of Query Optimization Methods

  • Authors:
  • Abdelkader Hameurlain;Franck Morvan

  • Affiliations:
  • Institut de Recherche en Informatique de Toulouse IRIT, Paul Sabatier University, Toulouse Cedex, France 31062;Institut de Recherche en Informatique de Toulouse IRIT, Paul Sabatier University, Toulouse Cedex, France 31062

  • Venue:
  • Transactions on Large-Scale Data- and Knowledge-Centered Systems I
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Query optimization is the most critical phase in query processing. In this paper, we try to describe synthetically the evolution of query optimization methods from uniprocessor relational database systems to data Grid systems through parallel, distributed and data integration systems. We point out a set of parameters to characterize and compare query optimization methods, mainly: (i) size of the search space, (ii) type of method (static or dynamic), (iii) modification types of execution plans (re-optimization or re-scheduling), (iv) level of modification (intra-operator and/or inter-operator), (v) type of event (estimation errors, delay, user preferences), and (vi) nature of decision-making (centralized or decentralized control).The major contributions of this paper are: (i) understanding the mechanisms of query optimization methods with respect to the considered environments and their constraints (e.g. parallelism, distribution, heterogeneity, large scale, dynamicity of nodes) (ii) pointing out their main characteristics which allow comparing them, and (iii) the reasons for which proposed methods become very sophisticated.