Jump Searching: A Fast Sequential Search Technique

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.

CACM October, 1978

Shneiderman, B.

Jump searching, sequential files, file management,
search strategies, database structures, index 
searching

3.74 4.34

CA781003 DH January 29, 1979  6:15 PM

3058	4	3058
3063	4	3058
2978	5	3058
3058	5	3058
3058	5	3058
3058	5	3058