Abstract
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 language | English |
---|---|
Pages (from-to) | 39-47 |
Number of pages | 9 |
Journal | SIGIR Forum (ACM Special Interest Group on Information Retrieval) |
DOIs | |
State | Published - 1995 |
Event | Proceedings of the 18th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval - Seattle, WA, USA Duration: 9 Jul 1995 → 13 Jul 1995 |