Reviews the use of signatures to improve the performance of text searching and considers the use of signature trees to further accelerate text searching. Based on the analysis of experimental results, it is concluded that the improvement in text searching performance using signature trees outweighs the increase in required storage. (12 references)…

Presents a model and experimental results of a new one-phase technique for compression text files that is a modification of the Ziv and Lempel compression scheme. The description includes the use of a subword dictionary that is periodically reorganized based on information theory and structural linguistics principles. (29 references) (Author/CLB)

Investigates applicability of inverted file processing in magnetic bubble memories by presenting four magnetic bubble memory models as storage mediums: one based on a major-minor loop configuration; one utilizing a decoder design on a magnetic bubble memory chip; and two based on different structural configurations of the first two. (MBR)

Discusses ranking techniques for document retrieval and proposes an evaluation, or filtering, technique that reduces costs and memory usage by early recognition of which documents are likely to be highly ranked. Highlights include index design, ranked query evaluation, reducing the number of accumulators, inverted file structures, and experimental…

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…