Added by Geoff Sauer on Mar 02, 2009.
Average rating: 3.00/5.00 (n=1)
 


This paper proposes a general synchronization grammar which can describe synchronization rule sets. For example, when handling three input files, we show that changes to elements can be described in terms of just seven possible permutations. Similarly, PCDATA and attribute changes can be described in terms of a fixed set of permutations. Using these permutations a grammar is proposed, allowing precise description of synchronization algorithms and rule sets and providing a testable framework for their implementation. The paper applies the resulting grammar to existing synchronization tools and technologies and shows how the grammar can be applied to provide solutions for specific application areas, including document workflow and translation.
 
  View all 111 works published by IDEAlliance  

Please share your rating/opinion of "Generalized Grammar for Three-way XML Synchronization".
 PoorExcellent 
The link to this work seems to be broken.

Copyright © 2001-09 by the EServer. All rights reserved.Add a Work | Update this Work | Discussion Forum | Habitués