Mar. 29, 2005 to Mar. 31, 2005
Alistair MoffaT , The University of Melbourne, Victoria, Australia
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2005.22
In many applications of compression, decoding speed is at least as important as compression effectiveness. For example, the large inverted indexes associated with text retrieval mechanisms are best stored compressed, but a working system must also process queries at high speed. Here we present two coding methods that make use of fixed binary representations. They have all of the consequent benefits in terms of decoding performance, but are also sensitive to localized variations in the source data, and in practice give excellent compression. The methods are validated by applying them to various test data, including the index of an 18 GB document collection.
Alistair MoffaT, "Binary Codes for Non-Uniform Sources", DCC, 2005, Data Compression Conference, Data Compression Conference 2005, pp. 133-142, doi:10.1109/DCC.2005.22