A genetic algorithm for the index selection problem

Authors:
Jozef Kratica;Ivana Ljubic;Dušan Tošic
Affiliations:
Institute of Mathematics, Serbian Academy of Sciences and Arts, Belgrade, Yugoslavia;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria;Faculty of Mathematics, University of Belgrade, Belgrade, Yugoslavia
Venue:
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Year:
2003

Citing 7
Cited 11

Physical database design for relational databases

ACM Transactions on Database Systems (TODS)
Optimal Selection of Secondary Indexes

IEEE Transactions on Software Engineering
Separating lifted odd-hole inequalities to solve the index selection problem

Discrete Applied Mathematics
Efficient and Accurate Parallel Genetic Algorithms

Efficient and Accurate Parallel Genetic Algorithms
Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design

IEEE Transactions on Knowledge and Data Engineering
Uniform Crossover in Genetic Algorithms

Proceedings of the 3rd International Conference on Genetic Algorithms
On the Selection of an Optimal Set of Indexes

IEEE Transactions on Software Engineering

Evolving combinatorial problem instances that are difficult to solve

Evolutionary Computation
Hybrid greedy and genetic algorithms for optimization of relational data warehouses

AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
Improvement of Data Warehouse Optimization Process by Workflow Gridification

ADBIS '08 Proceedings of the 12th East European conference on Advances in Databases and Information Systems
Data mining-based materialized view and index selection in data warehouses

Journal of Intelligent Information Systems
Understanding TSP difficulty by learning from evolved instances

LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Online index selection in RDBMS by evolutionary approach

DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Discovering the suitability of optimisation algorithms by learning from evolved instances

Annals of Mathematics and Artificial Intelligence
Property analysis of symmetric travelling salesman problem instances acquired through evolution

EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Automatic selection of bitmap join indexes in data warehouses

DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Static and incremental selection of multi-table indexes for very large join queries

ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
An integer programming approach for the view and index selection problem

Data & Knowledge Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.