Describes the theoretical framework of a retrieval system that uses data structures called bitmaps to improve search algorithms for medium-sized systems. Information retrieval systems that contain the full text of the documents are discussed, and the use of inverted files such as concordances for small texts is explained. (24 references) (LRW)

Discusses the problems of compressing a large textual database for storage on CD-ROM. A text-compression algorithm is presented, new algorithms for compression of indices are described, and the ARTFL (American and French Research on the Treasury of the French Language) database is used as an example. (14 references) (LRW)

Introduces the multicharacter trie as an index structure that can improve the time needed for retrieving full-text materials stored on CD-ROMs. The advantages of this structure compared to other structures are described, and experimental results comparing it to the widely used B+ tree and other structures used for full-text retrieval are…