Interpolation search—a log log N search-Reference-Cited by-同舟云学术

Interpolation search—a log log N search

Published:1978-07 Issue:7 Volume:21 Page:550-553
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Perl Yehoshua¹,Itai Alon²,Avni Haim³

Affiliation:

1. Bar-Ilan Univ., Ramat Gan, Israel

2. Israel Institute of Technology, Haifa, Israel

3. The Weizmann Institute of Science, Rehovot, Israel

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 log N 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.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/359545.359557

Reference8 articles.

1. Doob J.L. Stochastic Processes Wiley New York 1967. Doob J.L. Stochastic Processes Wiley New York 1967.

2. Feller W. An Introduction to Probability Theory and Its Applications Vol. 1. Wiley New York third ed. 1968. Feller W. An Introduction to Probability Theory and Its Applications Vol. 1. Wiley New York third ed. 1968.

3. File Organization: On the Selection of Random Access Index Points for Sequential Files

4. Karlin S. and Taylor H.M. A First Course in Stochastic Processes. Academic Press New York second ed. 1975. Karlin S. and Taylor H.M. A First Course in Stochastic Processes. Academic Press New York second ed. 1975.

Cited by 75 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Interpolation Once Binary Search over a Sorted List;Mathematics;2024-05-02

2. NV-QALSH+: Locality-Sensitive Hashing Optimized for Non-volatile Memory;Lecture Notes in Computer Science;2024

3. CATE: A fast and scalable CUDA implementation to conduct highly parallelized evolutionary tests on large scale genomic data;Methods in Ecology and Evolution;2023-06-29

4. Indexing for Near-Sorted Data;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04

5. CATE: A fast and scalable CUDA implementation to conduct highly parallelized evolutionary tests on large scale genomic data;2023-02-03