论文信息 - Overhead Storage Considerations and a Multilinear Method for Data File Compression

Overhead Storage Considerations and a Multilinear Method for Data File Compression

The paper is concerned with the reduction of overhead storage, i.e., the stored compression/decompression (C/D) table, in field-level data file compression. A large C/D table can occupy a lage fraction of maim memory space during compression and decompression, and may cause excessve page swapping in virtual memory systems. A two-stage approach is studied, including the reuired additional C/D table decompression time. It appears that the approach has limitations and is not completely satisfactory.

Tzay Y. Young | Philip S. Liu

[1] Tzay Y. Young,et al. Linear transformation of binary random vectors and its application to approximating probability distributions , 1978, IEEE Trans. Inf. Theory.

[2] P.A. Alsberg,et al. Space and time savings through large data base compression and dynamic restructuring , 1975, Proceedings of the IEEE.

[3] Frank Rubin,et al. Experiments in text file compression , 1976, CACM.

[4] Philippe G. H. Lehot,et al. A classification of compression methods and their usefulness for a large data processing center , 1975, AFIPS '75.

[5] Thomas S. Huang. An upper bound on the entropy of run-length coding (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[6] EliasPeter. Efficient Storage and Retrieval by Content and Address of Static Files , 1974 .

[7] Richard C. T. Lee,et al. Application of Principal Component Analysis to Multikey Searching , 1976, IEEE Transactions on Software Engineering.

[8] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[9] Philip S. Liu,et al. Techniques of Program Execution with a Writable Control Memory , 1978, IEEE Transactions on Computers.

[10] Richard C. T. Lee,et al. Storage Reduction Through Minimal Spanning Trees and Spanning Forests , 1977, IEEE Transactions on Computers.

[11] Bruce Hahn,et al. A new technique for compression and storage of data , 1974, Commun. ACM.