Authors: Kratica, Jozef 
Ljubić, Ivana
Tošić, Dušan
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: A genetic algorithm for the index selection problem
Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 2611
First page: 280
Last page: 290
Conference: Workshops on Applications of Evolutionary Computation, EvoWorkshops 2003
Issue Date: 1-Dec-2003
ISBN: 978-3-540-00976-4
ISSN: 0302-9743
DOI: 10.1007/3-540-36605-9_26
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 branch-and-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.
Publisher: Springer Link

Show full item record


checked on Jun 23, 2024

Page view(s)

checked on May 10, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.