Jump searching
- 1 October 1978
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 21 (10) , 831-834
- https://doi.org/10.1145/359619.359623
Abstract
When sequential file structures must be used and binary searching is not feasible, jump searching becomes an appealing alternative. This paper explores variants of the classic jump searching scheme where the optimum jump size is the square root of the number of records. Multiple level and variable size jump strategies are explored, appropriate applications are discussed and performance is evaluated.Keywords
This publication has 6 references indexed in Scilit:
- Analysis of design alternatives for virtual memory indexesCommunications of the ACM, 1977
- Batched searching of sequential and tree structured filesACM Transactions on Database Systems, 1976
- Binary Search Trees and File OrganizationACM Computing Surveys, 1974
- A nucleus of a theorem-prover described inAlgol-68International Journal of Parallel Programming, 1974
- Polynomial searchSoftware: Practice and Experience, 1973
- A Simple Algorithm for Merging Two Disjoint Linearly Ordered SetsSIAM Journal on Computing, 1972