Space and time savings through large data base compression and dynamic restructuring
- 1 January 1975
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 63 (8) , 1114-1122
- https://doi.org/10.1109/proc.1975.9903
Abstract
The conventional general-purpose data management system tends to make inefficient use of storage space. By reducing the physical size of the data, substantial savings are available in the area of storage cost. Reduction ratios of 4:1 and more are realizable. This also reduces the amount of I/O time required to physically transfer data between secondary and primary memories. Since I/O time tends to be the pacing factor when processing large data bases, this could produce a 4:1 or greater reduction in response time. Data compression experience with four large data bases is described. In some applications, only a small fraction of the data transferred in an individual I/O operation is relevant to the query being processed. If usage patterns are measured and data records and fields are rearranged so that those which are commonly referenced together are also physically stored together, then additional savings are available. Once the data base has been partitioned into clusters of commonly accessed data, further efficiencies can be obtained by choosing data structures, compression strategies, and storage devices that are optimal for the recent usage pattern observed on that cluster.Keywords
This publication has 4 references indexed in Scilit:
- File compression using variable length encodingsThe Computer Journal, 1972
- Data compression techniques for economic processing of large commercial filesPublished by Association for Computing Machinery (ACM) ,1971
- Optimum procedures for economic information retrievalInformation Storage and Retrieval, 1970
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952