Yehoshua Perl
Abstract
Interpolation search is a method of retrieving a desired record by key in an ordered file by using the value of the key and the statistical distribution of the keys. It is shown that on the average log logN file accesses are required to retrieve a key, assuming that the N keys are uniformly distributed. The number of extra accesses is also estimated and shown to be very low. The same holds if the cumulative distribution function of the keys is known. Computational experiments confirm these results.
- 1 Doob, J.L. Stochastic Processes, Wiley, New York, 1967.Google Scholar
- 2 Feller, W. An Introduction to Probability Theory and Its Applications, Vol. 1. Wiley, New York, third ed., 1968.Google Scholar
- 3 Ghosh, S.P., and Senko, M.E. File organization: On the selection of random access index points for sequential files. JA CM 16 (1969), 569-579. Google ScholarDigital Library
- 4 Karlin, S., and Taylor, H.M. A First Course in Stochastic Processes. Academic Press, New York, second ed., 1975.Google Scholar
- 5 Knuth, D.E. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, Reading, Mass., 1973, pp. 406422. Google Scholar
- 6 Perl, Y., and Reingold, E.M. Understanding and complexity of interpolation Search. Infrm. Proc. Letters, 6 (1977), 219-222.Google ScholarCross Ref
- 7 Peterson, W.W. Addressing for random-access storage. IBM J. Res. and Develop. 1 (1957), 131-132.Google ScholarDigital Library
- 8 Yao, A.C., and Yao, F.F. The complexity of searching an ordered random table. Proc. Seventeenth Annual Symp. Foundations ofComptr. Sci., 1976, pp. 173-177.Google ScholarDigital Library
Index Terms
- Interpolation search—a log logN search
Recommendations
Dynamic Interpolation Search revisited
AbstractA new dynamic Interpolation Search (IS) data structure is presented that achieves O ( log log n ) search time with high probability on unknown continuous or even discrete input distributions with measurable probability of element ...
Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time
The first algorithm that searches unindexed and nonuniformly distributed ordered files in $\log \log N$ expected time is presented in this paper. Our analysis rests on a synthesis of concepts from the literature on interpolation search and on the method ...
On the Complexity of Search Algorithms
The average complexity for searching a record in a sorted file of records that are stored on a tape is analyzed for four search algorithms, namely, sequential search, binary search, Fibonacci search, and a modified version of Fibonacci search. The ...
Comments