Skip to main content
SpringerLink
Log in

The fractional greedy algorithm for data compression

Der Fractional Greedy Algorithmus für Datenkomprimierung

  • Published:
Computing Aims and scope Submit manuscript

Abstract

Text-compression problems are considered where substrings are substitued by code-words according to a static dictionary such that the original text is encoded by a shorter code sequence. We introduce a new efficient on-line heuristic which locally maximizes the compaction ratio. The worst-case behaviour of this fractional greedy heuristic is investigated for several types of dictionaries.

Zusammenfassung

Es werden Text-Komprimierungsprobleme behandelt, bei denen Teilworte durch Codeworte ersetzt werden, sodaß der ursprüngliche Text durch eine kürzere Codesequenz repräsentiert wird. Das geschieht mit Hilfe eines statischen Wörterbuchs. Wir führen eine neue effiziente on-line Heuristik ein, welche die lokale Komprimierungsrate maximiert. Von diesem fractional greedy Verfahren wird das Verhalten im schlechtesten Fall für verschiedene Typen von Wörterbüchern untersucht.

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. Békési, J., Galambos G., Pferschy, U., Woeginger, G. J.: Greedy algorithms for on-line data compression. Report 276-93, Mathematical Institute, TU Graz, Austria 1993.

    Google Scholar 

  2. Gonzalez-Smith, M. E., Storer, J. A.: Parallel algorithms for data compression. J. ACM32, 344–373 (1985).

    Google Scholar 

  3. Katajainen, J., Raita, T.: An analysis of the longest matching and the greedy heuristic in text encoding. J. ACM39, 281–294 (1992).

    Google Scholar 

  4. Schuegraf, E. J., Heaps, H. S.: A comparison of algorithms for data base compression by use of fragments as language elements. Inf. Stor. Ret.10, 309–319 (1974).

    Google Scholar 

  5. Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory23, 337–343 (1977).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, JGYTF, P.O. Box 396, H-6720, Szeged, Hungary

    J. Békési & G. Galambos

  2. Institut für Mathematik B, TU Graz, Steyrergasse 30, A-8010, Graz, Austria

    U. Pferschy & G. J. Woeginger

Authors
  1. J. Békési
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Galambos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. U. Pferschy
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. G. J. Woeginger
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was partially supported by the Christian Doppler Laboratorium für Diskrete Optimierung and by the Fonds zur Förderung der wissenschaftlichen Forschung, Project P8971-PHY.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Békési, J., Galambos, G., Pferschy, U. et al. The fractional greedy algorithm for data compression. Computing 56, 29–46 (1996). https://doi.org/10.1007/BF02238290

Download citation

  • Received:

  • Issue Date:

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

AMS Subject Classfication

Key words

Search

Navigation