An efficient algorithm to compute differences between structured documents

@article{Lee2004AnEA,
  title={An efficient algorithm to compute differences between structured documents},
  author={Kyong-Ho Lee and Yoon-Chul Choy and Sung-Bae Cho},
  journal={IEEE Transactions on Knowledge and Data Engineering},
  year={2004},
  volume={16},
  pages={965-979}
}
SGML/XML are having a profound impact on data modeling and processing. We present an efficient algorithm to compute differences between old and new versions of an SGML/XML document. The difference between the two versions can be considered to be an edit script that transforms one document tree into another. The proposed algorithm is based on a hybridization of bottom-up and top-down methods: The matching relationships between nodes in the two versions are produced in a bottom-up manner and then… CONTINUE READING
Highly Cited
This paper has 33 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 26 references

An O(ND) Difference Algorithm and Its Variations,

  • E. Myers
  • Algorithmica, vol. 1,
  • 1986
Highly Influential
10 Excerpts

On the Complexity of the Extended String-to-String Correction Problem,

  • R. Wagner
  • Proc. Seventh ACM Symp. Theory of Computation,
  • 1975
Highly Influential
4 Excerpts

The XML Handbook

  • C. F. Goldfarb, P. Prescod
  • Prentice Hall
  • 1998
3 Excerpts

Similar Papers

Loading similar papers…