A technique for isolating differences between files

@article{Heckel1978ATF,
  title={A technique for isolating differences between files},
  author={Paul Heckel},
  journal={Commun. ACM},
  year={1978},
  volume={21},
  pages={264-268}
}
  • P. Heckel
  • Published 1 April 1978
  • Computer Science
  • Commun. ACM
A simple algorithm is described for isolating the differences between two files. [] Key Method Another application of this algorithm merges files containing independently generated changes into a single file. The algorithm can also be used to generate efficient encodings of a file in the form of the differences between itself and a given “datum” file, permitting reconstruction of the original file from the diference and datum files.

Figures from this paper

Diff library in Eiffel ( Diffeif )

This documentation gives an overview of some existing line-based and treebased algorithms, explains the implemented algorithms in detail accompanying with a performance analysis and provides a short overview of the implementation and the usage of the Diffeif library.

Delta storage for arbitrary non-text files

This paper deals with a technique for generating deltas between arbitrary files without any presumptions about the file structure and measures of exwution time and the size of resulting delta scripts conclude the paper.

Identifying syntactic differences between two programs

  • Wuu Yang
  • Computer Science
    Softw. Pract. Exp.
  • 1991
A comparison algorithm is developed that can point out the differences between two programs more accurately than previous text comparison tools and is based on a dynamic programming scheme.

Computation and Visualization of Differences between two XML Music Score Files

The goal is to implement for music scores a utility similar to the Unix diff command for text files to identify differences between two score files which are relatively similar, corresponding to the intuitive notion of difference.

Direct merging of delta encoded files

In-place differential file compression of nonaligned files with applications to file distribution, backups, and string similarity

This work presents a preprocessing step for string alignment that can be employed when the encoder determines significant gains will be achieved and compares well with other existing methods, including those that are not in-place.

Bidirectional Delta Files

Modeling delta encoding of compressed files

An optimal algorithm in terms of processing time for constructing the delta encoding when both files are compressed using LZW is presented, and whether successive ordered pairs refer to successive substrings and can thus be combined is checked.

In-place differential file compression

The experiments indicate that these algorithms compare favorably with traditional approaches, even those that are not in-place, while at the same time having low encoding complexity and extremely low decoding complexity.
...

References

SHOWING 1-10 OF 11 REFERENCES

Bounds on the Complexity of the Longest Common Subsequence Problem

It is shown that unless a bound on the total number of distinct symbols is assumed, every solution to the problem can consume an amount of time that is proportional to the product of the lengths of the two strings.

The String-to-String Correction Problem

An algorithm is presented which solves the string-to-string correction problem in time proportional to the product of the lengths of the two strings.

WYLBUR: an interactive text editing and remote job entry system

The external appearance of WYLBUR as well as its internal structure are described and a powerful method for addressing text by content is provided.

An online editor

An online, interactive system for text editing is described in detail, with remarks on the theoretical and experimental justification for its form. Emphasis throughout the system is on providing

The Art of Computer Programming

The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.

A linear space algorithm for computing maximal common subsequences

The problem of finding a longest common subsequence of two strings has been solved in quadratic time and space. An algorithm is presented which will solve this problem in quadratic time and in linear

The Art of Computer Programming, Vol. 3: Sorting and Searching

A technique for isolating differences between files

  • A technique for isolating differences between files

Interactive Systems Consultants

  • Interactive Systems Consultants

Digital Equipment Corp. DEC System 10 Assembly Language Handbook

  • Digital Equipment Corp. DEC System 10 Assembly Language Handbook
  • 1967