Two different directory structuring techniques--division hash technique and a hydrid technique--are compared for the same set of keys with directories of from 10,000 to 100,000 unique keys. Retrieval costs, in terms of the number of accesses of secondary storage required to retrieve the keys, are considered in detail. (Author)

Indicates how a college, with an IBM 1130 computer, can facilitate information storage and retrieval by using magnetic disc storage in conjunction with ACT Program, 80-column Hollerith-type card format especially designed for the college. (JF)

Traditional and table-driven methods of editing input data for a data-storage system are compared. An application of table-driven input editing is described for a high-volume, multiple-format, clinical data-base. (Author)

The design of programs to search large document data bases is discussed with regard to the use of compression coding combined with adoption of word fragments as the basic language elements. An algorithm is described for determination of a set of almost equifrequent fragments. Its efficiency is tested. (23 references) (Author)

Conversion of the Chemical Abstract Service scientific literature data base from Standard Distribution Format to a center-oriented file format, STF, is described. A tape file format is described in which variable length logical records, possibly longer than the blocksize, may be stored safely. (7 references) (Author/NH)

Subroutines which provide efficient access to a directly organized file by blocking and deblocking variable length bibliographic records are described. (Author)

SPIRES (Stanford Public Information REtrieval System) is a computer information storage and retrieval system being developed at Stanford University with funding from the National Science Foundation. SPIRES has two major goals: to provide a user-oriented, interactive, on-line retrieval system for a variety of researchers at Stanford; and to support…

A new method for concentrating keywords of a thesaurus, based on a mathematical study of the distribution of characters in a defined natural language. (Author/KP)

Chemical structure diagrams are considered as utterances in a written language. Two types of grammars are considered for this language: topological grammars and geometric grammars. The hypothesis is presented that compact computer storage may become accessible via grammars. (15 references) (Author/NH)

Defines a hash coding model for non-unique search keys and derives the expected number of accesses needed to retrieve all desired records from a computer storage device. (Author)

A modular program is recommended for automation of the clippings file of "The Daily Texan" (student newspaper of the University of Texas at Austin). The proposed system will lead ultimately to on-line storage of the index, on-line storage of local, staff-written news stories from the previous twenty-four months, micrographic storage for backup and…

The Fort Detrick Information Retrieval System is a system of computer programs written in COBOL for a CDC 3150 to store and retrieve information about the scientific and technical reports and documents of the Fort Detrick Technical Library. The documents and reports have been abstracted and indexed. This abstract, the subject matter descriptors,…

Intrex is an experimental bibliographic and full text storage and retrieval system which has advanced the concept of the on-line interactive search of a computer stored bibliographic data base and the on-line access to a microfiche document storage. The Intrex system includes a set of computer programs designed for information retrieval, a…

The Information Flow System is a large-scale information retrieval system developed for processing of Du Pont information files. As currently implemented, the system stores and retrieves information on company technical reports. Extensions of the system for handling chemical structure information and on-line processing are also discussed. (3…

Retrospective search of large data bases requires development of special techniques for automatic compression of data and minimization of the number of input-output operations to the computer files. The computer program should require a relatively small amount of internal memory. This paper describes the structure of such a program. (9 references)…