Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Alignment of trees: an alternative to tree edit
Theoretical Computer Science
Change detection in hierarchically structured information
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Meaningful change detection in structured data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The String-to-String Correction Problem
Journal of the ACM (JACM)
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
New algorithm for ordered tree-to-tree correction problem
Journal of Algorithms
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Efficient Parallel Algorithms for Tree Editing Problems
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
A Survey of Longest Common Subsequence Algorithms
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Detecting Changes in XML Documents
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
A three-way merge for XML documents
Proceedings of the 2004 ACM symposium on Document engineering
A survey on tree edit distance and related problems
Theoretical Computer Science
Towards XML version control of office documents
Proceedings of the 2005 ACM symposium on Document engineering
Fast and simple XML tree differencing by sequence alignment
Proceedings of the 2006 ACM symposium on Document engineering
Efficient algorithms for finding interleaving relationship between sequences
Information Processing Letters
Learning probabilistic models of tree edit distance
Pattern Recognition
Merging changes in XML documents using reliable context fingerprints
Proceedings of the eighth ACM symposium on Document engineering
Managing Branch Versioning in Versioned/Temporal XML Documents
XSym '07 Proceedings of the 5th international Symposium on XML Database: Database and XMLTechnologies
Versioning XML-based office documents
Multimedia Tools and Applications
Efficient and reliable merging of XML documents
Proceedings of the 18th ACM conference on Information and knowledge management
Semantics-based change impact analysis for heterogeneous collections of documents
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
A file-type sensitive, auto-versioning file system
Proceedings of the 10th ACM symposium on Document engineering
Proceedings of the 11th ACM symposium on Document engineering
A generic calculus of XML editing deltas
Proceedings of the 11th ACM symposium on Document engineering
A change detection system for unordered XML data using a relational model
Data & Knowledge Engineering
XCC: change control of XML documents
Computer Science - Research and Development
Introduction to the universal delta model
Proceedings of the 2013 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 |
XML-based documents play a major role in modern information architectures and their corresponding workflows. In this context, the ability to identify and represent differences between two versions of a document is essential. Several approaches to finding the differences between XML documents have already been proposed. Typically, they are based on tree-to-tree correction, or sequence alignment. Most of these algorithms, however, are too slow and do not support the subsequent merging of changes. In this paper, we present a differencing algorithm tailored to ordered XML documents, called DocTreeDiff. It relies on our context-oriented XML versioning model which allows for document merging, presented in earlier work. An empiric evaluation demonstrates the efficiency of our approach as well as the high quality of the generated deltas.