.png){kind=icon}
Return
Efficient Renaming in Sequence CRDTs
.png){kind=icon}
OA
AI
DOI：10.1109/TPDS.2022.3172570.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To achieve high availability, large-scale distributed systems have to replicate data and to minimise coordination between nodes. For these purposes, literature and industry increasingly adopt Conflict-free Replicated Data Types (CRDTs) to design such systems. Conflict-free Replicated Data Types (CRDTs) are new specifications of existing data types, e.g., Set or Sequence. While CRDTs have the same behaviour as previous specifications in sequential executions, they actually shine in distributed settings as they natively support concurrent updates. To this end, CRDTs embed in their specification conflict resolution mechanisms. These mechanisms usually rely on identifiers attached to elements of the data structure to resolve conflicts in a deterministic and coordination-free manner. Identifiers have to comply with several constraints, such as being unique or belonging to a dense total order. These constraints may hinder the identifier size from being bounded. Identifiers hence tend to grow as the system progresses, which increases the overhead of CRDTs over time and leads to performance issues. To address this issue, we propose a novel Sequence CRDT which embeds a renaming mechanism. It enables nodes to reassign shorter identifiers to elements in an uncoordinated manner. Experimental results demonstrate that this mechanism decreases the overhead of the replicated data structure and eventually minimises it.
Keywords:
Peer-to-peer computing
Data structures
Metadata
Collaboration
Semantics
Real-time systems
Distributed databases
CRDTs
replication
real-time collaborative editing
eventual consistency
memory-wise optimisation
performance
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSave
View more