THE MINICARD SYSTEM. A CASE STUDY IN THE APPLICATION OF STORAGE AND RETRIEVAL THEORY
Abstract
The developing theory (AD-137 471) of information storage and retrieval (ISAR) is tested by applying it to the Minicard system. Optimum searching speed in any ISAR system involves an arrangement of the files. The search time of the Minicard system is equivalent to that of the IBM 701 system. The inherent limitations of the Minicard system are brought out in further discussions on prearranged files; prefiling or posting; search terms, filing positions, and dedicated space; the size of the Minicard system; selection with the Minicard system; and selection circuitry. The study indicates that no space can be saved by the system, although there will be one system of terms, classes, postings, rate of growth, codes, and uses which will match the optimum operating conditions of the Minicard system, just as there is a set of parameters which would make the Batten system, the Uniterm system, the Matrex system, the Rapid selector, the EDIAC, or on ordinary card catalog the best system.
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 01, 1956
- Accession Number
- AD0137472