[
Lists Home |
Date Index |
Thread Index
]
- From: Gabe Beged-Dov <begeddov@jfinity.com>
- To: XML List <xml-dev@ic.ac.uk>
- 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@ic.ac.uk
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@ic.ac.uk the following message;
(un)subscribe xml-dev
To subscribe to the digests, mailto:majordomo@ic.ac.uk the following message;
subscribe xml-dev-digest
List coordinator, Henry Rzepa (mailto:rzepa@ic.ac.uk)
|
