Advertisement

A Genetic Algorithm for the Index Selection Problem

  • Jozef Kratica
  • Ivana Ljubić
  • Dušan Tošić
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2611)

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 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.

Keywords

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Krarup and P.M. Pruzan. The simple plant location problem: Survey and synthesis. European Journal of Operational Research, 12:36–81, 1983.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    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.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    E. Barcucci, R. Pinzani, and R. Sprugnoli. Optimal selection of secondary indexes. IEEE Transactions on Software Engineering, 16, 1990.Google Scholar
  5. 5.
    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.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    S. Finkelstein, M. Schkolnick, and P. Tiberio. Physical database design for relational databases. ACM Transactions on Database Systems, 13:91–128, 1988.CrossRefGoogle Scholar
  8. 8.
    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.zbMATHMathSciNetGoogle Scholar
  9. 9.
    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.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    J. Kratica. Improving performances of the genetic algorithm by caching. Computers and Artificial Intelligence, 18(3):271–283, 1999.zbMATHGoogle Scholar
  11. 11.
    J. Kratica. Parallelization of Genetic Algorithms for Solving Some NP-complete Problems (in Serbian). PhD thesis, Faculty of Mathematics, Belgrade, 2000.Google Scholar
  12. 12.
    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.Google Scholar
  13. 13.
    V. Filipović. Proposition for improvement tournament selection operator in genetic algorithms (in serbian). Master’s thesis, Faculty of Mathematics, Belgrade, 1998.Google Scholar
  14. 14.
    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.Google Scholar
  15. 15.
    Erick Cantu-Paz. Efficient and Accurate Parallel Genetic Algorithms. Kluwer Academic Publishers, Boston, 2000.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Jozef Kratica
    • 1
  • Ivana Ljubić
    • 2
  • Dušan Tošić
    • 3
  1. 1.Institute of MathematicsSerbian Academy of Sciences and ArtsBelgradeYugoslavia
  2. 2.Institute of Computer Graphics and AlgorithmsVienna University of TechnologyViennaAustria
  3. 3.Faculty of MathematicsUniversity of BelgradeBelgradeYugoslavia

Personalised recommendations