Ben Shneiderman
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.
- 1 CODASYL Data Base Task Group Report, April 1971. Available from ACM, New York.Google Scholar
- 2 Date, C.J. An Introduction to Database Systems. Addison-Wesley, Reading, Mass., 2nd Ed., 1977. Google ScholarDigital Library
- 3 Hwang, F.K., and Lin, S. A simple algorithm for merging two disjointed linearly ordered sets. SlAM J. Comptng. 1, 1 (March 1972), 31-39.Google ScholarCross Ref
- 4 Knuth, D. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley; Reading, Mass., 1973. Google ScholarDigital Library
- 5 Martin, J. Computer Data-Base Organization. Prentice-Hall, Englewood Cliffs, N.J., 2nd Ed., 1977. Google ScholarDigital Library
- 6 Maruyama, K., and Smith, S.E. Analysis of design alternatives for virtual memory indexes. Comm. ACM 20, 4 (April 1977), 245-254. Google ScholarDigital Library
- 7 Nievergelt, J. Binary search trees and file organization. A CM Computing Surveys 6, 3 (Sept. 1974), 195-207. Google ScholarDigital Library
- 8 OS/VS Virtual Storage Method (VSAM) Planning Guide. Order No. GC26-3799, IBM Corp., White Plains, N.Y.Google Scholar
- 9 Pippenger, N. Group testing. IBM Res. Rep. RC.6218, IBM T. J. Watson Res. Ctr., Yorktown Heights, N.Y., Sept. 1976.Google Scholar
- 10 Shneiderman, B. Polynomial search. Software--Practice and Experience 3 (1973), 5-8.Google ScholarDigital Library
- 11 Shneiderman, B. A model for optimizing indexed file structures. Int. J. Comptr. and Inform. Sci. 3, 1 (1974).Google ScholarCross Ref
- 12 Shneiderman, B., and Goodman, V. Batched searching of sequential and tree structured files. A CM Trans. Database Systems 1, 3 (Sept. 1976), 268-275. Google ScholarDigital Library
- 13 Strong, H.R., Markowsky, G., and Chandra, A.K. Searching within a page. IBM Res. Rep. RJ 2080, IBM Res. Lab., San Jose, Calif., Sept. 1977.Google Scholar
- 14 Wagner, R.E. Indexing design considerations. IBM Syst. J. 10, 4 (1973), 351-367.Google Scholar
Index Terms
- Jump searching: a fast sequential search technique
Recommendations
Optimization of large sequential data files
ACM '77: Proceedings of the 1977 annual conferenceThe need for inexpensive data storage continues to grow and tape reels are usually used. For large data aggregations with even a few retrieval applications, it may not be as economical to store full reels as to split the data into smaller sized files. ...
Batched searching of sequential and tree structured files
The technique of batching searches has been ignored in the context of disk based online data retrieval systems. This paper suggests that batching be reconsidered for such systems since the potential reduction in processor demand may actually reduce ...
A study and comparison of multimedia Web searching: 1997–2006
Searching for multimedia is an important activity for users of Web search engines. Studying user's interactions with Web search engine multimedia buttons, including image, audio, and video, is important for the development of multimedia Web search ...
Comments