I need this for patching. I can't change the first xml, but I have the possibility to apply .xslt to create patched version from original file.
Which commands I should use?
Also, which command will create the second .xml from first xml and xslt ?
i.e. I want something like MS XMLDiffPatch (~year 2002), but with XSLT instead of Diffgram (Xml Diff Language).
I expected that such work is already done for XSLT. Because for RFC5261 (https://www.rfc-editor.org/rfc/rfc5261) it was done in 2012 (3 years ago) - http://github.com/Bonuspunkt/XmlPatch
Any version of XSLT is suitable (i.e. 2.0, 3.0).
Some theoretical works in this field:
- 2012, Egor Ivkin, Comparison of Tree Edit Distance Algorithms
https://is.cuni.cz/webapps/zzp/download/130082162/?lang=en - 2009, Demaine, Mozes, Rossman, Weimann. An Optimal Decomposition Algorithm for Tree Edit Distance
http://www.cs.haifa.ac.il/~oren/Publications/TEDinTALG.pdf - 2008, Beat Fluri, Change distilling. Enriching software evolution analysis with fine-grained source code change histories
http://www.zora.uzh.ch/16421/1/fluri_dissertation_2008.pdf - 2008, Daniel Ehrenberg, Matching, diffing and merging XML
http://useless-factor.blogspot.ru/2008/01/matching-diffing-and-merging-xml.html - 2007, Joe Tekli; Richard Chbeir; Kokou Yetongnon, Efficient XML Structural Similarity Detection using Sub-tree Commonalities
http://le2i.cnrs.fr/IMG/publications/Efficient%20XML%20Structural%20Similarity%20Detection%20using%20Sub-tree%20Commonalities.pdf - 2001, Gabriel Valiente. An Efficient Bottom-Up Distance between Trees
http://www.cs.upc.edu/~valiente/abs-spire-2001.pdf - 1998, Philip N. Klein, Computing the Edit-Distance Between Unrooted Ordered Trees
http://www.cs.brown.edu/research/pubs/pdfs/1998/Klein-1998-CED.pdf - 1996, Sudarshan S. Chawathe, Anand Rajaraman, Hector Garcia-Molina, and Jennifer Widom, Change Detection in Hierarchically Structured Information
http://ilpubs.stanford.edu:8090/115/1/1995-46.pdf - 1995, David T. Barnard, Gwen Clarke, Nicholas Duncan, Tree-to-tree Correction for Document Trees
http://research.cs.queensu.ca/TechReports/Reports/1995-372.pdf - 1993, Kaizhong Zhang; Dennis Shasha; Jason T. L. Wang, Approximate Tree Matching in the Presence of Variable Length Don't Cares
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.36.2804&rep=rep1&type=pdf
(pages are in reversed order - read it from bottom) - 1989, Kaizhong Zhang and Dennis Shasha, Simple fast algorithms for the editing distance between trees and related problems
http://www.grantjenks.com/wiki/_media/ideas:simple_fast_algorithms_for_the_editing_distance_between_tree_and_related_problems.pdf
Tutorial: http://www.youtube.com/watch?v=hwiks-n7vso - 1983, Walter F. Tichy, The String-to-String Correction Problem with Block Moves
http://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1377&context=cstech - 1979, Kuo-Chung Tai, The Tree-to-Tree Correction Problem
http://www.grantjenks.com/wiki/_media/ideas/treetotreecorrect.pdf - 1978, Paul Heckel, A Technique for Isolating Differences Between Files
http://documents.scribd.com/docs/10ro9oowpo1h81pgh1as.pdf
Linked questions:
- Track changes to XML file in XSLT format
- How to correctly diff trees (that is, nested lists of strings)?
- Building an HTML Diff/Patch Algorithm
- Diff algorithms
- tree / diff-algorithm
- Calculate minimal operations to make two tree structures identical
- Diff Algorithm?
- Semantic Diff Utilities
- XML Diff and Merge