SOME PROBLEMS OF DATA STORAGE AND RETRIEVAL IN DIGITAL COMPUTER FAST STORES,
Abstract
The ordering and retrieval of information is considered a single problem; i.e., an analysis is made of the algorithms with the purpose of minimizing the total number of operations. An equation is derived for the optimal number of information sub blocks for which the total number of information retrieval search cycles is a minimum, and a graphical solution of the equation is worked out. The case in which the information is continuously renewed and must be processed continuously rather than after reception of the entire block is considered. In this calculation, it is assumed that the information is acquired uniformly and that the average time between the input of two elements is used as the time unit. The optimal number of input information elements for which the total number of search and ordering cycles is a minimum for the length of time in which the search is made is determined. The relations obtained in this article permit choosing the fastest information retrieval algorithm for a particular type of digital computer operation. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 13, 1970
- Accession Number
- AD0703567
Entities
People
- A. A. Papernov
- G. V. Stasevich
Organizations
- National Air and Space Intelligence Center