The IceCube approach to the reconciliation of divergent replicas
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
An algebraic approach to file synchronization
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Generalizing operational transformation to the standard general markup language
CSCW '02 Proceedings of the 2002 ACM conference on Computer supported cooperative work
A Commutative Replicated Data Type for Cooperative Editing
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Logoot: A Scalable Optimistic Replication Algorithm for Collaborative Editing on P2P Networks
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Validity-sensitive querying of XML databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
| Hi-index | 0.02 |
Collaborative edition is achieved by distinct sites that work independently on (a copy of) a shared document. In pure Peer to Peer collaborative editing, no centralization nor locks nor timestamps, therefore convergence, i.e. all sites have the same copy of the shared document, is the main issue. When the editing operations defined on the data structure enjoy a commutation property, efficient algorithms can be designed. The XML language provides a widely used format for documents and these documents are usually typed by DTD's or XML Schemas that are subclasses of regular tree languages. We extend a collaborative editing algorithm that relies on a notion of semantics dependence for operations and a tree data structure implementing XML documents to handle type information provided by DTD's or XML Schemas (and more generally regular tree languages). We show that the algorithm is convergent and that the final document has the required type.