Skip to main content
SpringerLink
Log in

An adaptation of a root finding method to searching ordered disk files

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

Three methods for locating a record in an ordered file are considered. The keys in the files are chosen from three different statistical distributions and the methods, two of which are taken from the literature and an adapted root finding method, are compared by tabulating information relating to standard statistics for the number of probes.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. P. Brent,Algorithms for Minimization Without Derivatives, Prentice Hall, 1973.

  2. F. Warren Burton and N. Gilbert Lewis,A robust variation of interpolation search. Information Processing Letters 10 (1980), 198–201.

    Google Scholar 

  3. Dowell, M. and P. Jarratt,A modified regula falsi method for computing the root of an equation. BIT 11 (1971), 168–174.

    Google Scholar 

  4. M. Dowell and P. Jarratt,The Pegasus method for computing the root of an equation. BIT 12 (1972), 503–508.

    Google Scholar 

  5. C. E. Gerald and Patrick O. Wheatley,Applied Numerical Analysis, 3rd. Edition, Addison Wesley 1984.

  6. G. H. Gonnet,Interpolation and Interpolation-Hash Searching, Research Report CS-77-02 (Ph.D. Thesis), University of Waterloo, Department of Computer Science, 1977.

  7. R. F. King,An improved Pegasus method for root finding. BIT 13 (1973), 423–427.

    Google Scholar 

  8. Yehoshus Perl, Along Itai and Haim Avni,Interpolation search — a log log N search, Comm. of the ACM 21 (July 1978), 550–553.

    Google Scholar 

  9. Anne C. Stratton,Comparison of Searching Techniques, M. Sc. (C.S.) thesis, University of New Brunswick, New Brunswick, Canada (1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Centre, University of New Brunswick, E3B 5A3, Fredericton, N.B., Canada

    A. C. Armenakis

  2. Division of Math, Eng. and Comp. Sc., University of New Brunswick, E2L 4L5, Saint John, N.B., Canada

    L. E. Garey & R. D. Gupta

Authors
  1. A. C. Armenakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. E. Garey
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. D. Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Armenakis, A.C., Garey, L.E. & Gupta, R.D. An adaptation of a root finding method to searching ordered disk files. BIT 25, 561–568 (1985). https://doi.org/10.1007/BF01936136

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation