On merging structured documents with move operation

Authors:
Nobutaka Suzuki;Yorichiro Sato;Michiyoshi Hayase
Affiliations:
Okayama Prefectural University, Soja-shi, Japan;Okayama Prefectural University, Soja-shi, Japan;Okayama Prefectural University, Soja-shi, Japan
Venue:
ISICT '03 Proceedings of the 1st international symposium on Information and communication technologies
Year:
2003

Citing 6
Cited 0

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
Meaningful change detection in structured data

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Comparing Hierarchical Data in External Memory

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Detecting Changes in XML Documents

ICDE '02 Proceedings of the 18th International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider merging structured documents, which is to transform given two distinct documents into isomorphic ones. Such merging is essential to synchronizing several copies of a document concurrently edited by several clients. Two documents, treated as ordered trees, are merged by applying a merge script consisting of add, del, upd, and move operations to the documents. We prove that the corresponding decision problem to finding an optimum merge script is NP-complete. Then, we show a sufficient condition under which an optimum merge script can be found in polynomial time.