Advertisement

Hierarchic index sequential search with optimal variable block size and its minimal expected number of comparisons

  • Wolfgang Janko
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 71)

Abstract

Multilevel indexes are intensively used for accessing records in files. The search costs can considerably be reduced by selecting the number of levels and the size of the index at each level optimally. In this paper a multilevel and variable size index design strategy is developed which minimizes the expected number of comparisons. Its performance is evaluated in dependence of the number of levels for unsuccessful and successful search. A method to determine the number of levels which minimizes the expected number of comparisons is presented. The number of index entries and index files is given. The relevance of the results for jump searching is indicated. As an asymptotic upper bound for the minimal number of comparisons in an index sequential search the expression log2n +0.5 log2log2n is derived for n=( i 2i ).

Keywords

Block Length Index File Successful Search Level Search Dimensional Search 
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]
    Janko, W. Zur optimalen Blocklänge beim m-Weg-Suchverfahren, Angew. Informatik, Heft 11, 1976, pp. 487–489.Google Scholar
  2. [2]
    Martin, J. Computer Data-Base Organisation, Prentice-Hall, Englewood Cliffs, N.Y., 2nd Ed., 1977.Google Scholar
  3. [3]
    Overholt, K.J. Efficiency of the Fibonacci Search Method, BIT, Nordisk Tidskr. Inform.-behandl., Vol. 13 (1973), pp. 92–96.Google Scholar
  4. [4]
    Shneiderman, B. Jump Searching: A Fast Sequential Search Technique, Commun. ACM, Vol. 21 (1978), No. 10, pp. 831–834.Google Scholar
  5. [5]
    Shneiderman, B. Polynomial Search, Software-Practice and Experience, Vol. 3 (1973), pp. 5–8.Google Scholar
  6. [6]
    Shneiderman, B. A Model for Optimizing Indexed File Structures, Intern. J. Computer Inform. Sci., Vol. 3 (1974), No. 1, pp.93–103.Google Scholar
  7. [7]
    Six, H.W. Verbesserung des m-Weg-Suchverfahrens, Angew. Informatik, Heft 2, 1973, pp. 79–83.Google Scholar
  8. [8]
    Wagner, R.E. Indexing Design Considerations, IBM Syst. J., Vol. 10 (1973), No. 4, pp. 351–367.Google Scholar
  9. [9]
    Wedekind, H. Datenorganisation, Walter de Gruyter & Co., Berlin, 1970.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Wolfgang Janko
    • 1
  1. 1.University of KarlsruheW-Germany

Personalised recommendations