Response time in large, inverted file document retrieval systems is determined by time required to access files of document identifiers on disk and process a Boolean search request. A specialized computer system has been devised that can perform a complicated sample search involving 70 terms and over 60,000 document references 12 to 60 times…

A bulk data input processor which is available for the Rapidly Extensible Language (REL) English versions is described. In REL English versions, statements that declare names of data items and their interrelationships normally are lines from a terminal or cards in a batch input stream. These statements provide a convenient means of declaring some…

This article presents a brief history of the videodisc and describes three major current manifestations of this storage medium--read-only, write-once, erasable. The current status of write-once technology, major corporations involved in the field, potential uses for various types of storage media, and software and market trends are highlighted.…

Provides an analysis of the CONversion of SERials (CONSER) Project from the point of view of an academic librarian who has been involved in reference service functions. (Author/PF)

The binary vector is suggested as an alternative to the usual method of storing document pointers in an inverted index file. (Author)

The Retrieval of information by means of freely-chosen descriptors may be handled efficiently by creating an inverted file organization in an adaptive manner, entries in this file being generated by sequential searching of the master file, when required. (Author)

Presents a word-based technique for storing natural language text in compact form. The compressed text consists of a dictionary and a text that is a combination of actual running text and pointers to the dictionary. This technique has shown itself to be effective for both text storage and retrieval. (VT)

An English summary is provided for this French article which describes the first stage of a research project using the Bose, Ghosh and Abraham theory with attributes of multiple values applied to a file containing a large number (10 6) of records. (7 references) (Author/SJ)

Substantial degrees of compression of bibliographical data bases result from the application to them of a modified form of run-length coding. (14 references) (Author)

This report delineates the theory and terminology of data compression. It surveys four data compression methods--null suppression, pattern substitution, statistical encoding, and telemetry compression--and relates them to a standard statistical coding problem, i.e., the noiseless coding problem. The well defined solution to that problem can serve…

Reports on the state of currently available digital storage and retrieval systems and describes in detail one-sided optical videodisc LaserData and the Mnemos system, which stores graphic images on microfiche discs. Video Patsearch, Matrox, Philips Megadoc, DEMAND, and Digital Recording Corporation's optical digital records and future videodisc…

Analyzes structure of, and data in, the OCLC-MARC record in the form delivered via OCLC's Tape Subscription Service, and outlines important processing functions involved: "unreadable tapes," duplicate records and deduping, match processing, choice processing, locations processing, "automatic" and "input" stamps,…

Reviews hardware (microfilm, videodiscs, computers) which can process and retrieve large amounts of educational information. Identifies ways in which computer-based techniques can be used for course management, direct learning, and research. (Author/DC)

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)

Extensions are required to the currently operational INGRES data base system for it to manage a data base distributed over multiple machines in a computer network running the UNIX operating system. Three possible user views include: (1) each relation in a unique machine, (2) a user interaction with the data base which can only span relations at a…