Cart
[Home] [By Thread] [By Date] [Recent Entries]
It also depends on which kind of document you want to compare (Goedel's incompletude theorem in CS 1st year :)=)... It might not be possible to find a generic algorithm. That's why there is canonical XML. -----Message d'origine----- De : Jonathan Robie [mailto:jonathan.robie@d...] Envoye : jeudi 23 octobre 2003 13:18 A : Radhakrishna Murthy (RBIN/EEC1); xml-dev@l... Cc : xml-editor@w... Objet : Re: Regd XML algorithms !! At 11:36 PM 10/22/2003, Radhakrishna Murthy (RBIN/EEC1) wrote: >hi everyone, > My name is Radhakrishna. Welcome to the list! > i need the information on different algorithms availble to get diffrence > of contents between 2 XML files. > I visited lot of sites.But i couldn't able to get the generic > algorithm.Every organizatoin has builded it's own algorithms. > > Are they any such algorithms to read the contents of XML files. Try searching for the words "xml diff algorithm" in Google, it will pull up a bunch of references to papers. Some of these papers assume that identity can be assigned to nodes, others do not. I didn't have time to read these thoroughly, but this reference looks useful: http://www.cs.wisc.edu/niagara/papers/xdiff.pdf Jonathan ----------------------------------------------------------------- The xml-dev list is sponsored by XML.org <http://www.xml.org>, an initiative of OASIS <http://www.oasis-open.org> The list archives are at http://lists.xml.org/archives/xml-dev/ To subscribe or unsubscribe from this list use the subscription manager: <http://lists.xml.org/ob/adm.pl>
|
