Sciweavers

EVOW
2003
Springer

A Genetic Algorithm for the Index Selection Problem

13 years 9 months ago
A Genetic Algorithm for the Index Selection Problem
This paper considers the problem of minimizing the response time for a given database workload by a proper choice of indexes. This problem is NP-hard and known in the literature as the Index Selection Problem (ISP). We propose a genetic algorithm (GA) for solving the ISP. Computational results of the GA on standard ISP instances are compared to branchand-cut method and its initialisation heuristics and two state of the art MIP solvers: CPLEX and OSL. These results indicate good performance, reliability and efficiency of the proposed approach.
Jozef Kratica, Ivana Ljubic, Dusan Tosic
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where EVOW
Authors Jozef Kratica, Ivana Ljubic, Dusan Tosic
Comments (0)