Title :
Storage Reduction Through Minimal Spanning Trees and Spanning Forests
Author :
Kang, A.N.C. ; Lee, Richard C T ; Chang, Chin-liang ; Chang, Shi-kuo
Author_Institution :
Bell Laboratories
fDate :
5/1/1977 12:00:00 AM
Abstract :
It is often possible to save storage space in a computer by storing only the differences among data items rather than the entire items. For example, suppose we have two records A and B. We should store all of A, then for B store a pointer to A and the differences between A and B. If A and B are similar, there will be few differences and storage space can be saved.
Keywords :
Analysis of algorithms, memory storage reduction, minimal spanning trees, spanning forests.; Animals; Iron; Proteins; Roentgenium; Space exploration; Space technology; Analysis of algorithms, memory storage reduction, minimal spanning trees, spanning forests.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1977.1674859
