ACM Computing Surveys (CSUR)
Fast decoding of the Huffman codes
Information Processing Letters
Storing text retrieval systems on CD-ROM: compression and encryption considerations
ACM Transactions on Information Systems (TOIS)
Efficient decoding of prefix codes
Communications of the ACM
Compression, information theory, and grammars: a unified approach
ACM Transactions on Information Systems (TOIS)
The Computer Journal
A systematic approach to compressing a full-text retrieval system
Information Processing and Management: an International Journal - Special issue on data compression for images and texts
Data compression in full-text retrieval systems
Journal of the American Society for Information Science
In situ generation of compressed inverted files
Journal of the American Society for Information Science
Adding compression to a full-text retrieval system
Software—Practice & Experience
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Fast searching on compressed text allowing errors
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Efficient variants of Huffman codes in high level languages
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
Generating a canonical prefix encoding
Communications of the ACM
Information Retrieval: Computational and Theoretical Aspects
Information Retrieval: Computational and Theoretical Aspects
Managing Gigabytes: Compressing and Indexing Documents and Images
Managing Gigabytes: Compressing and Indexing Documents and Images
Text Compression for Dynamic Document Databases
IEEE Transactions on Knowledge and Data Engineering
Space-efficient construction of optimal prefix codes
DCC '95 Proceedings of the Conference on Data Compression
Searching in Compressed Dictionaries
DCC '02 Proceedings of the Data Compression Conference
Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
Information Processing and Management: an International Journal
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
Information Processing and Management: an International Journal
| Hi-index | 0.00 |
A new data structure is investigated, which allows fast decoding of texts encoded by canonical Huffman codes. The storage requirements are much lower than for conventional Huffman trees, O(log^2 n) for trees of depth O(log n), and decoding is faster, because a part of the bit-comparisons necessary for the decoding may be saved. Empirical results on large real-life distributions show a reduction of up to 50% and more in the number of bit operations. The basic idea is then generalized, yielding further savings.