An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Batched searching of sequential and tree structured files
ACM Transactions on Database Systems (TODS)
Binary Search Trees and File Organization
ACM Computing Surveys (CSUR)
Analysis of design alternatives for virtual memory indexes
Communications of the ACM
Computer Database Organization, 2nd Ed
Computer Database Organization, 2nd Ed
On-Line Personal Bibliographic Retrieval System
SIGIR '79 Proceedings of the 2nd annual international ACM SIGIR conference on Information storage and retrieval: information implications into the eighties
New algorithms for block segregated multiple key search strategy
CIS'09 Proceedings of the international conference on Computational and information science 2009
| Hi-index | 48.22 |
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.