Common phrases and minimum-space text storage
Communications of the ACM
WYLBUR: an interactive text editing and remote job entry system
Communications of the ACM
ACM Computing Surveys (CSUR)
ACM Transactions on Database Systems (TODS)
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
Journal of the ACM (JACM)
Data compression via textual substitution
Journal of the ACM (JACM)
A Practical Approach to Selecting Record Access Paths
ACM Computing Surveys (CSUR)
File archival techniques using data compression
Communications of the ACM
On the space requirements of navigational relationship representations
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
A New Compression Method with Fast Searching on Large Databases
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
The macro model for data compression (Extended Abstract)
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Storing text using integer codes
COLING '86 Proceedings of the 11th coference on Computational linguistics
A compression technique for large statistical data-bases
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Efficient access of compressed data
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
| Hi-index | 48.23 |
The widespread tendency toward storage of large programs and blocks of text has produced a need for efficient methods of compressing and storing data. This paper describes techniques that can, in most cases, decrease storage size by a factor of from two to four. The techniques involve special handling of leading and trailing blanks, and the encoding of other symbols in groups of fixed size as unique fixed point numbers. The efficiency of the system is considered and pertinent statistics are given and compared with statistics for other information coding techniques.