Fixing collaborative edition on typed documents

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Martin, S., & Lugiez, D. (2010). Fixing collaborative edition on typed documents. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6240 LNCS, pp. 19–26). https://doi.org/10.1007/978-3-642-16066-0_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free