Describes a system that provides online access to holdings information for more than 4,500 journals on a single self-executing diskette. A brief discussion of data compression is offered, along with program listings in both BASIC and C. (MES)

Discusses information retrieval and the use of binary trees as a fast access method for search strategies such as hashing. Proposes new methods based on compact binary trees that provide faster access and more compact storage, explains the theoretical basis, and confirms the validity of the methods through empirical observations. (LRW)

Presents uniform and efficient approach for processing all truncated query terms in information retrieval which requires one disk access to obtain from the permuted dictionary all strings represented by truncated term. The problem of the overhead storage required to implement the permuted dictionary is discussed. Fifteen references are provided.…

Discusses indexes for text databases and presents an efficient implementation of an index for text searching called PAT array, or suffix array, where the database is stored on secondary storage devices such as magnetic or optical disks. Additional hierarchical index structures and searching algorithms are proposed that improve searching time, and…

Zipfian laws for frequency distributions of word pairs and longer phrases are derived from text sample analysis. From crossing of Zipfian curves, it is deduced that number of multi-word phrases that occur frequently in text is surprisingly small, of same order of magnitude as number of individual word-types. (8 references) (EJS)