By Topic

Space and time savings through large data base compression and dynamic restructuring

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Alsberg, P.A. ; University of Illinois at Urbana-Champaign, Urbana, Ill.

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.

Published in:

Proceedings of the IEEE  (Volume:63 ,  Issue: 8 )