Genetic algorithm for the multiple-query optimization problem


Bayir M. A. , Toroslu I. H. , Cosar A.

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, cilt.37, ss.147-153, 2007 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 37 Konu: 1
  • Basım Tarihi: 2007
  • Doi Numarası: 10.1109/tsmcc.2006.876060
  • Dergi Adı: IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS
  • Sayfa Sayıları: ss.147-153

Özet

Producing answers to a set of queries with common tasks efficiently is known as the multiple-query optimization (MQO) problem. Each query can have several alternative evaluation plans, each with a different set of tasks. Therefore, the goal of MQO is to choose the right set of plans for queries which minimizes the total execution time by performing common tasks only once. Since MQO is an NP-hard problem, several, mostly heuristics based, solutions have been proposed for solving it. To the best of our knowledge, this correspondence is the first attempt to solve MQO using an evolutionary technique, genetic algorithms.