This paper reports on a variety of compression algorithms devel oped in the context of a project to put all the data files for a full-text retrieval system on a ('I)-Kom. In the context of inexpensive pre processing. a text compression algorithm is presented that is based on Markov-modelod Huffman coding on an extended alphabet. Data structures are examined for facilitating random access into the coinpressed text. In addition, new algorithms are presented for compres sion of word indices, both the dictionaries (word lists), and the text pointers (concordances).