Efficient recompression techniques for dynamic full-text retrieval systems

Research output: Contribution to journalConference articlepeer-review


An efficient variant of an optimal algorithm is presented, which, in the context of a large dynamic full-text information retrieval system, reorganizes data that has been compressed by an on-the-fly compression method based on LZ77, into a more compact form, without changing the decoding procedure. The algorithm accelerates a known technique based on a reduction to a graph-theoretic problem, by reducing the size of the graph, without affecting the optimality of the solution. The new method can thus effectively improve any dictionary compression scheme using a static encoding method.

Original languageEnglish
Pages (from-to)39-47
Number of pages9
JournalSIGIR Forum (ACM Special Interest Group on Information Retrieval)
StatePublished - 1995
EventProceedings of the 18th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval - Seattle, WA, USA
Duration: 9 Jul 199513 Jul 1995


Dive into the research topics of 'Efficient recompression techniques for dynamic full-text retrieval systems'. Together they form a unique fingerprint.

Cite this