Skip to main content
SpringerLink
Log in

Compact storage schemes for formatted files by spanning trees

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

The use of spanning trees in the compression of data files is studied. A new upper bound for the length of the minimal spanning tree, giving the size of the compressed file, is derived. A special front compression technique is proposed for unordered files. The space demands are compared to an information theoretical lower bound of the file size.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Peter A. Alsberg,Space and time saving through large data base compression and dynamic restructuring, Proc. of the IEEE, Vol. 63, No. 8, August 1975.

  2. Jon Louis Bentley and Jerome H. Friedman,Fast algorithms for constructing minimal spanning trees in coordinate spaces, IEEE Transactions on Computers, Vol. C-27, No. 2, February 1978.

  3. H. Blasbalg and R. Van Blerkom,Message Compression, in Data Compression, ed. by Lee D. Davisson and Robert M. Gray (Dowden), Hutchington & Ross, 1976.

  4. Francis Chin and Davin Houck,Algorithms for updating minimal spanning trees, Journal of Computer and Systems Sciences, Vol. 16, No. 3, June 1978.

  5. Doron Gottlieb, Steven A. Hagerth, Philippe G. H. Lehot and Henry S. Rabinowitz,A classification of compression methods and their usefulness for a large data processing center, National Computer Conference USA 1975.

  6. A. N. C. Kang, Richard C. T. Lee, Ching-Liang Chang and Shi-Kuo Chang,Storage reduction through minimal spanning trees and spanning forests, IEEE Transactions on Computers, Vol. C-26, No. 5, May 1977.

  7. Donald E. Knuth,The Art of Computer Programming, Vol. 1,Fundamental Algorithms, 2nd ed. Addison-Wesley, Reading, MA, 1973.

    Google Scholar 

  8. Edward M. Reingold, Jurg Nievergelt and Narisngh Deo,Combinatorial Algorithms. Theory and Practice, Prentice-Hall, New Jersey, 1977.

    Google Scholar 

  9. Daniel J. Rosenkrantz, Richard E. Stearns and Philip M. Lewis II,An analysis of several heuristics for the traveling salesman problem, SIAM J. Comput., Vol. 6, pp. 563–581.

  10. Ernst J. Schuegraf,A survey of data compression methods for non-numerical records, Canadian Journal of Information Sciences, Vol. 2, No. 1, 1976.

  11. Richard C. Singleton,Maximum distance q-nary codes, IEEE Trans. Inform. Theory IT-10 (1964).

  12. V. Kevin and M. Whitney,Algorithm 422 minimal spanning tree H, Collected Algorithms of CACM.

  13. Gio Wiederhold,Database Design, McGraw-Hill Book Company, NY, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Turku, SF-20500, Turku 50, Finland

    J. Ernvall & O. Nevalainen

Authors
  1. J. Ernvall
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. O. Nevalainen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ernvall, J., Nevalainen, O. Compact storage schemes for formatted files by spanning trees. BIT 19, 463–475 (1979). https://doi.org/10.1007/BF01931262

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01931262

Key Words and Phrases

CR Categories

Search

Navigation