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.
- Genetic Algorithm
- Answer Time
- Uniform Crossover
- Maintenance Time
- Elitist Individual
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Tax calculation will be finalised at checkout
Purchases are for personal use onlyLearn about institutional subscriptions
Unable to display preview. Download preview PDF.
J. Krarup and P.M. Pruzan. The simple plant location problem: Survey and synthesis. European Journal of Operational Research, 12:36–81, 1983.
D. W. Tcha and B.-Y. Lee. A branch-and-bound algorithm for the multilevel uncapacitated facility location problem. European Jornal of Operational Research, 18(1):35–43, 1984.
Y. A. Kochetov and E. N. Goncharov. Probabilistic tabu search algorithm for the multi-stage uncapacitated facility location problem. In B. Fleischmann, R. Lasch, U. Derigs, W. Domschke, and U. Rieder, editors, Operations Research Proceedings 2000, pages 65–70. Springer, 2000.
E. Barcucci, R. Pinzani, and R. Sprugnoli. Optimal selection of secondary indexes. IEEE Transactions on Software Engineering, 16, 1990.
M.Y.L. Ip, L.V. Saxton, and V.V. Raghavan. On the selection of an optimal set of indexes. IEEE Transactions on Software Engineering, pages 135–143, 1983.
A. Caprara, M. Fischetti, and D. Maio. Exact and approximate algorithms for the index selection problem in physical database design. IEEE Transactions on Knowledge and Data Engineering, 7(6), 1995.
S. Finkelstein, M. Schkolnick, and P. Tiberio. Physical database design for relational databases. ACM Transactions on Database Systems, 13:91–128, 1988.
A. Caprara and J.J. Salazar Gonzalez. A branch-and-cut algorithm for a generalization of the uncapacitated facility location. Problem Trabajos de Operativa-TOP, 4(1):135–163, 1996.
A. Caprara and J.J Salazar Gonzalez. Separating lifted odd-hole inequalities to solve the index selection problem. Discrete Applied Mathematics, 92:111–134, 1999.
J. Kratica. Improving performances of the genetic algorithm by caching. Computers and Artificial Intelligence, 18(3):271–283, 1999.
J. Kratica. Parallelization of Genetic Algorithms for Solving Some NP-complete Problems (in Serbian). PhD thesis, Faculty of Mathematics, Belgrade, 2000.
G. Syswerda. Uniform crossover in genetic algorithms. In 3th International Conference on Genetic ALgorithms, ICGA’89, pages 2–9, Internet, 1989. Morgan Kaufmann, San Mateo, Calif.
V. Filipović. Proposition for improvement tournament selection operator in genetic algorithms (in serbian). Master’s thesis, Faculty of Mathematics, Belgrade, 1998.
V. Filipović, J. Kratica, D. Tošić, and I. Ljubić. Fine grained tournament selection for the simple plant location problem. In 5th Online World Conference on Soft Computing Methods in Industrial Applications, WSC5, pages 152–158, Internet, 2000. ISBN: 951-22-5205-8.
Erick Cantu-Paz. Efficient and Accurate Parallel Genetic Algorithms. Kluwer Academic Publishers, Boston, 2000.
Editors and Affiliations
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kratica, J., Ljubić, I., Tošić, D. (2003). A Genetic Algorithm for the Index Selection Problem. In: Cagnoni, S., et al. Applications of Evolutionary Computing. EvoWorkshops 2003. Lecture Notes in Computer Science, vol 2611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36605-9_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00976-4
Online ISBN: 978-3-540-36605-8
eBook Packages: Springer Book Archive