Amortized efficiency of list update and paging rules
Communications of the ACM
Syntax-directed compression of program files
Software—Practice & Experience
Text compression using prediction
Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
ACM Computing Surveys (CSUR)
Signature files: an access method for documents and its analytical performance evaluation
ACM Transactions on Information Systems (TOIS)
Implementation of the substring test by hashing
Communications of the ACM
ACM Computing Surveys (CSUR)
On-line data compression in a log-structured file system
ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
| Hi-index | 0.00 |
The knowledge of a short substring constitutes a good basis for guessing the next character in a natural language text. This observation, i.e. repeated guessing and encoding of subsequent characters, is very fundamental for the predictive text compression. The paper describes a family of such compression methods, using a hash table for searching the prediction information. The experiments show that the methods produce good compression gains and, moreover, are very fast. The one-pass versions are especially apt for “on-the-fly” compression of transmitted data, and could be a basis for specialized hardware.