Skip to main content
SpringerLink
Log in

Genetic algorithms and the search for optimal database index selection

  • Track 7: Data Base
  • Conference paper
  • First Online:
Computing in the 90's (Great Lakes CS 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 507))

Included in the following conference series:

Abstract

The problem of the search for an optimum database index selection problem is an NP-complete problem. Genetic algorithms have been shown to be robust algorithms for searching large spaces for optimal objective function values. Genetic algorithms use historical information to speculate about new areas in the search space with expected improved performance. The feasibility of the application of genetic algorithms to the optimal database index selection is studied in this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Booker, L.B., Goldberg, D.E., Holland, J.H., Classifier Systems and Genetic Algorithms. Cognitive Science and Machine Learning Laboratory, Technical Report No. 8. The University of Michigan, Ann Arbor, MI.

    Google Scholar 

  2. Comer, D. The difficulty of optimum index selection. ACM Transactions on Database Systems, 3(4), 440–445.

    Google Scholar 

  3. Goldberg, D.E. Genetic Algorithms: In search optimization & machine learning. Reading, MA: Addison-Wesley.

    Google Scholar 

  4. Grefenstette, J.J., Gopala, B.J., & D.V. Gucht, Genetic Algorithms for the Traveling Salesman Problem. In Proceedings of an International Conference on Genetic Algorithms and Their Applications (pp 136–140), Carnegie-Mellon University, Pittsburgh, PA.

    Google Scholar 

  5. Holland, J.H. Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor, MI.

    Google Scholar 

  6. Holland, J.H. Escaping brittleness: The possibilities of general purpose learning algorithms applied to parallel rule-based systems. In R. S. Michalski, J.G. Carbonell, & T. M. Mitchell (Eds.), Machine Learning II (pp. 593–623). Los Altos, CA: Morgan Kaufmann.

    Google Scholar 

  7. Piatetsky-Shapiro, G. The Optimal Selection of Secondary Indices is NP-Complete. In SIGMOD Record, Vol 13-N2, (pp 72–75).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Wayne State University, 48202, Detroit, MI, USA

    Farshad Fotouhi & Carlos E. Galarce

Authors
  1. Farshad Fotouhi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carlos E. Galarce
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Naveed A. Sherwani Elise de Doncker John A. Kapenga

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fotouhi, F., Galarce, C.E. (1991). Genetic algorithms and the search for optimal database index selection. In: Sherwani, N.A., de Doncker, E., Kapenga, J.A. (eds) Computing in the 90's. Great Lakes CS 1989. Lecture Notes in Computer Science, vol 507. Springer, New York, NY. https://doi.org/10.1007/BFb0038500

Download citation

  • DOI: https://doi.org/10.1007/BFb0038500

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97628-0

  • Online ISBN: 978-0-387-34815-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation