A string-wise CRDT for group editing

  title={A string-wise CRDT for group editing},
  author={Weihai Yu},
  journal={Proceedings of the 2012 ACM International Conference on Supporting Group Work},
  • Weihai Yu
  • Published 27 October 2012
  • Computer Science
  • Proceedings of the 2012 ACM International Conference on Supporting Group Work
Real-time group editing has been envisioned as an important application for group collaboration. Operational transformation (OT) has been the concurrency control mechanism for group editing, due to its potential for high responsiveness to local editing operations. OT algorithms are generally very sophisticated and computation intensive. Recently, commutative replicated data types (CRDT) have appeared as viable substitutes of OT. Existing OT and CRDT work suffers from serious limitations. This… 

Figures from this paper

Supporting String-Wise Operations and Selective Undo for Peer-to-Peer Group Editing

This paper presents an approach that combines and extends OT and CRDT strengths and supports string-wise editing operations and selective undo, and shows that it provides sufficient responsiveness to the end-users.

High Responsiveness for Group Editing CRDTs

This paper proposes to interpose an auxiliary data structure, called the identifier data structure in front of the base CRDT, which improves upstream execution time by several orders of magnitude, with negligeable impact on memory occupation, network bandwidth, and downstream execution performance.

LSEQ: an adaptive structure for sequences in distributed collaborative editing

This paper proposes and models LSEQ, an adaptive allocation strategy for a sequence CRDT that achieves in the average a sub-linear spatial-complexity whatever is the editing behaviour and validates it showing that it outperforms existing approaches.

Supporting adaptable granularity of changes for massive-scale collaborative editing

This paper offers a solution for handling an adaptable granularity for shared data that overcomes the limitations of fixed-grained data approaches and exhibits three implementations of this algorithm.

Concurrency Effects Over Variable-size Identifiers in Distributed Collaborative Editing

Distributed collaborative editors such as Google Docs or Etherpad allow to distribute the work across time, space and organizations. In this paper, we focus on distributed collaborative editors based

Causal and Total Order in Opportunistic Networks

This chapter examines how causal and total ordering can be achieved in an opportunistic network, and proposes a Commutative Replicated Data Type algorithm based on Logoot that uses the nature of opportunistic networks to its advantage.

Decentralized Kubernetes Federation Control Plane

This position paper presents the vision for a distributed decentralized Kubernetes federation control plane, based on a shared database of conflict-free replicated data types, shared among all clusters in the federation, and algorithms that make use of the data.

Préservation des Intentions et Maintien de la Cohérence des Données Répliquées en Temps Réel. (Intention Preservation and Consistency Maintenance for Real-Time Replicated Data)

La premiere contribution of cette these est un algorithme base sur l'approche des transformees operationnelles (OT), qui permet d'editer and de styliser du texte hierarchise tout en respectant les intentions of style, de deplacement ou d'insertion of texte ou de paragraphes.

Édition collaborative décentralisée dans les navigateurs

Un editeur collaboratif permet de repartir la tâche de redaction d'un document a travers le temps et l'espace. Par leur simplicite d'utilisation, les editeurs collaboratifs temps reel du Web ont

Managing cloud resource scarcity

This thesis examines the management of cloud resource scarcity from the perspectives of both Infrastructure and Service Providers, with the aim of finding ways to ensure that the end user experience is minimally affected.



Evaluating CRDTs for real-time document editing

This paper demonstrates the suitability of CRDTs for real-time collaborative editing, and collects editing logs from real- time peer-to-peer collaborations to reflect the tendency of decentralised collaboration.

Constant-time operation transformation and integration for collaborative editing

  • Weihai Yu
  • Computer Science
    7th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom)
  • 2011
This paper presents an approach that supports string operations and constant-time operation transformation and integration and is based on admissibility preservation, a correctness criterion with which the correctness of the approach can be formally proven.

A Commutative Replicated Data Type for Cooperative Editing

Treedoc is described, a novel CRDT design for cooperative text editing where the identifiers of Treedoc atoms are selected from a dense space and the results with traces from existing edit histories are validated.

Context-Based Operational Transformation in Distributed Collaborative Editing Systems

This paper analyzes the limitation of the causality theory, proposes a novel theory of operation context as the new foundation for OT systems, and presents a new OT algorithm-Context-based OT (COT)-which provides uniform and efficient solutions to both consistency maintenance and undo problems.

A partial persistent data structure to support consistency in real-time collaborative editing

A new persistent data structure-partial persistent sequence is proposed that enables to create unique character identifiers that can be used for associating meta-information and tracking their changes, and also design simple view synchronization algorithms to guarantee data consistency under the presence of concurrent updates.

Data consistency for P2P collaborative editing

This paper proposes a new model for building a collaborative editing system that is fully decentralised and does not depend on the number of sites.

Logoot-Undo: Distributed Collaborative Editing System on P2P Networks

This paper presents the Logoot-Undo CRDT algorithm, which integrates the "undo anywhere, anytime” feature, and it is proved that the cost of the undo feature remains low on a corpus of data extracted from Wikipedia.

An Approach to Ensuring Consistency in Peer-to-Peer Real-Time Group Editors

  • Du LiRui Li
  • Computer Science
    Computer Supported Cooperative Work (CSCW)
  • 2005
SDT is the first and the only OT algorithm proved to converge in peer-to-peer group editors and is based on a novel consistency model that is more explicitly formulated than previously established models for proving correctness.

ABTS: A transformation-based consistency control algorithm for wide-area collaborative applications

  • Bin ShaoDu LiNing Gu
  • Computer Science
    2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing
  • 2009
This paper proposes a novel OT algorithm that addresses the above two challenges as follows: first, it is based on a recent theoretical framework with formal conditions such that its correctness can be proved, and secondly, it supports two string-based primitive operations and handles overlapping and splitting of operations.

An algorithm for selective undo of any operation in collaborative applications

A novel OT-based algorithm is proposed that provides integrated do and selective undo and achieves time complexity of O(|H|) in both do and undo by keeping the history in a special operation effects relation order.