Abstract

In the last two years we have developed improved techniques for indexing and retrieval of text data, including algorithms for inversion, for compression of the data and index, and for efficient ranking. These techniques were, however, tested on relatively small databases. In this paper we describe the application of these techniques to a large (2 Gb) heterogeneous text database. Our experiments show that compression performance does not degrade with the increase in volume of data, and that response times remain small, confirming that the new techniques are suitable for large quantities of data.

Citations