论文信息 - Interpolation search—a log logN search

Interpolation search—a log logN search

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] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .

[2] Donald E. Knuth,et al. Sorting and Searching , 1973 .

[3] Samuel Karlin,et al. A First Course on Stochastic Processes , 1968 .

[4] Michael E. Senko,et al. File Organization: On the Selection of Random Access Index Points for Sequential Files , 1969, JACM.

[5] Donald E. Knuth,et al. The art of computer programming: sorting and searching (volume 3) , 1973 .

[6] Feller William,et al. An Introduction To Probability Theory And Its Applications , 1950 .

[7] Samuel Karlin,et al. ELEMENTS OF STOCHASTIC PROCESSES , 1975 .

[8] Yehoshua Perl,et al. Understanding the Complexity of Interpolation Search , 1977, Inf. Process. Lett..

[9] J. Doob. Stochastic processes , 1953 .

[10] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[11] W. W. Peterson,et al. Addressing for Random-Access Storage , 1957, IBM J. Res. Dev..

[12] Andrew Chi-Chih Yao,et al. The complexity of searching an ordered random table , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).