Describes fast, dynamic update algorithms for document retrieval systems. B-trees are discussed; the M-B-T file directory structure is explained; insertions and deletions in inverted files are described; and performance evaluation is discussed. An appendix provides the formal definition of an M-B-T directory. (Contains 18 references.) (LRW)

Compares the performance of inverted and signature file organizations in handling incrementally specified Boolean queries to an information retrieval system. The discussion covers the impact of more sophisticated signature file organizations, related problems, and possible future work. (65 references) (CLB)

Discussion of a new method of index term dictionary compression in an inverted-file-oriented database highlights a technique of word coding, which generates short fixed-length codes obtained from the index terms themselves by analysis of monogram and bigram statistical distributions. Substantial savings in communication channel utilization are…

This paper addresses the problem of data management techniques for efficiently retrieving requested subsets of large data sets from mass storage devices. Describes the development of algorithms and software that facilitate the partitioning of a large data set into multiple "clusters" that reflect their expected access. (Author/JKP)

Discusses the use of transaction logging in Okapi-related projects to allow search algorithms and user interfaces to be investigated, evaluated, and compared. A series of examples is presented, illustrating logging software for character-based and graphical user interface systems, and demonstrating the usefulness of relational database management…

Describes the unique reliability problems of very large databases that necessitate specialized techniques for hardware problem management. The discussion covers the use of controlled partial redundancy to improve reliability, issues in operating systems and database management systems design, and the impact of disk technology on very large…