xml diff?

Pavel Velikhov pvelikho at cs.ucsd.edu
Tue Dec 22 00:54:50 GMT 1998

Mark D. Anderson wrote:
> Suppose I want the "diff" between two xml files.
> I can imagine a few approaches:

> - graph-theoretic:
> surely there must be some CS work on algorithms for finding
> the least cost path between two trees, expressed as a sequence
> of operations? the simplest is with just the operations of
> add/delete of subtrees, but move and copy are interesting too.
> -mda

Here is a great paper on edit distance between trees (includes rather fancy edit commands, the result in an NP-complete problem however. But
you can choose any subset that seems useful and efficient):

S. Chawathe, H. Garcia-Molina "Meaningful Change Detection in Structured Data", SIGMOD 1997, http://www-db.stanford.edu/pub/papers/bbdiff.ps 


xml-dev: A list for W3C XML Developers. To post, mailto:xml-dev at ic.ac.uk
Archived as: http://www.lists.ic.ac.uk/hypermail/xml-dev/
To (un)subscribe, mailto:majordomo at ic.ac.uk the following message;
(un)subscribe xml-dev
To subscribe to the digests, mailto:majordomo at ic.ac.uk the following message;
subscribe xml-dev-digest
List coordinator, Henry Rzepa (mailto:rzepa at ic.ac.uk)

More information about the Xml-dev mailing list