Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Change detection in hierarchically structured information
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
A method for the dynamic generation of virtual versions of evolving documents
Proceedings of the 2002 ACM symposium on Applied computing
Change-Centric Management of Versions in an XML Warehouse
Proceedings of the 27th International Conference on Very Large Data Bases
A survey on tree edit distance and related problems
Theoretical Computer Science
Fast and simple XML tree differencing by sequence alignment
Proceedings of the 2006 ACM symposium on Document engineering
Merging changes in XML documents using reliable context fingerprints
Proceedings of the eighth ACM symposium on Document engineering
Commutativity analysis for XML updates
ACM Transactions on Database Systems (TODS)
Efficient change control of XML documents
Proceedings of the 9th ACM symposium on Document engineering
A web-based version editor for XML documents
Proceedings of the 9th ACM symposium on Document engineering
A formal investigation of Diff3
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Using versioned tree data structure, change detection and node identity for three-way XML merging
Proceedings of the 10th ACM symposium on Document engineering
Diffing, patching and merging XML documents: toward a generic calculus of editing deltas.
Proceedings of the 10th ACM symposium on Document engineering
Document changes: modeling; detection; storing and visualization (DChanges)
Proceedings of the 2013 ACM symposium on Document engineering
| Hi-index | 0.00 |
In previous work we outlined a mathematical model of the so-called XML editing deltas and proposed a first study of their formal properties. We expected at least three outputs from this theoretical work: a common basis to compare performances of the various algorithms through a structural normalization of deltas, a universal and flexible patch application model and a clearer separation of patch and merge engine performance from delta generation performance. This paper presents the full calculus and reports significant progresses with respect to formalizing a normalization procedure. Such method is key to defining an equivalence relation between editing scripts and eventually designing optimizers compiler back-ends, new patch specification languages and execution models.