[XML-DEV Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

XML TreeDiff algorithm ??

• From: Gabe Beged-Dov <begeddov@j...>
• To: XML List <xml-dev@i...>
• Date: Sun, 04 Apr 1999 17:15:08 -0700

I know that IBM has provided a set of beans that "efficiently
differentiate and update DOM
trees"(www.alphaworks.ibm.com/formula/XMLTreeDiff).  As far as I can
tell, there is no description of the algorithms used. I did a quick look
around and couldn't find any publications discussing tree diff/merge
algorithms.

Can anyone point me to articles or source on this topic?

Thanks,

Gabe Beged-Dov
www.jfinity.com


xml-dev: A list for W3C XML Developers. To post, mailto:xml-dev@i...
Archived as: http://www.lists.ic.ac.uk/hypermail/xml-dev/ and on CD-ROM/ISBN 981-02-3594-1
To (un)subscribe, mailto:majordomo@i... the following message;
(un)subscribe xml-dev
To subscribe to the digests, mailto:majordomo@i... the following message;
subscribe xml-dev-digest
List coordinator, Henry Rzepa (mailto:rzepa@i...)

• Prev by Date: Re: DOM
• Next by Date: Re: SUMMARY: XML Validation Issues (was: several threads)
• Previous by thread: Announce: XPDL (was XML is broken)
• Next by thread: Re: XML TreeDiff algorithm ??
• Index(es):
  • Date
  • Thread