Fast algorithms for the unit cost editing distance between trees
Journal of Algorithms
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 Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
The string-to-string correction problem with block moves
ACM Transactions on Computer Systems (TOCS)
Comparing Hierarchical Data in External Memory
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Edit Distance with Move Operations
CPM '02 Proceedings of the 13th 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 hybrid approach to optimistic file system directory tree synchronization
Proceedings of the 4th ACM international workshop on Data engineering for wireless and mobile access
Towards XML version control of office documents
Proceedings of the 2005 ACM symposium on Document engineering
Merging changes in XML documents using reliable context fingerprints
Proceedings of the eighth ACM symposium on Document engineering
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Versioning XML-based office documents
Multimedia Tools and Applications
Efficient change control of XML documents
Proceedings of the 9th ACM symposium on Document engineering
Efficient and reliable merging of XML documents
Proceedings of the 18th ACM conference on Information and knowledge management
Clustering template based web documents
ECIR'08 Proceedings of the IR research, 30th European conference on Advances in information retrieval
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
Vi-DIFF: understanding web pages changes
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
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
Towards a version control model with uncertain data
Proceedings of the 4th workshop on Workshop for Ph.D. students in information & knowledge management
XCC: change control of XML documents
Computer Science - Research and Development
Uncertain version control in open collaborative editing of tree-structured documents
Proceedings of the 2013 ACM symposium on Document engineering
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 |
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in practical applications due to the inherent complexity of the problem. We present a method for differencing XML as ordered trees based on mapping the problem to the domain of sequence alignment, applying simple and efficient heuristics in this domain, and transforming back to the tree domain. Our approach provides a method to quickly compute changes that are meaningful transformations on the XML tree level, and includes subtree move as a primitive operation. We evaluate the feasibility of our approach and benchmark it against a selection of existing differencing tools. The results show our approach to be feasible and to have the potential to perform on par with tools of a more complex design in terms of both output size and execution time.