IPD - Chair Tichy - Programming Systems

Delta algorithms: an empirical analysis

  • Name:

    Journal Article

  • Author:

    James J. Hunt
    Kiem-Phong Vo
    Walter F. Tichy

  • Summary

    Delta algorithms compress data by encoding one file in terms of another. This type of compression is useful in a number of situations: strong multiple versions of data, displaying differences, merging changes, distributing updates, storing backups, transmitting video sequences, and others. This article studies the performance parameters of several delta algorithms, using a benchmark of over 1,300 pairs of files taken from two successive releases of GNU software. Results indicate that modern delta compression algorithms based on Ziv-Lempel techniques significantly outperform diff, a popular but older delta compressor, in terms of compression ratio. The modern compressors also correlate better with the actual difference between files without sacrificing performance.

    Bibtex

    @article{Tichy98a,
    author={James J. Hunt, Kiem-Phong Vo, and Walter F. Tichy},
    title={Delta algorithms: an empirical analysis},
    year=1998,
    month=April,
    publisher={ACM},
    volume={7},
    url={http://ps.ipd.kit.edu/downloads/za_1998_delta_algorithms.pdf },
    doi={http://dx.doi.org/10.1145/279310.279321},
    number={2},
    pages={192-214},
    journal={Transactions on Software Engineering and Methodology (TOSEM)},
    }
  • Publisher:

    ACM 

  • Year:

    1998 

  • Links: