Go to:
Logótipo
Você está em: Start > Publications > View > Efficient state-based CRDTs by decomposition
Map of Premises
Principal
Publication

Efficient state-based CRDTs by decomposition

Title
Efficient state-based CRDTs by decomposition
Type
Article in International Conference Proceedings Book
Year
2014
Authors
Almeida, PS
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. View Authenticus page Without ORCID
Shoker, A
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. View Authenticus page Without ORCID
Baquero, C
(Author)
Other
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Conference proceedings International
Pages: 3:1-3:2
1st Workshop on the Principles and Practice of Eventual Consistency, PaPEC 2014
Amsterdam, 13 April 2014 through 13 April 2014
Indexing
Other information
Authenticus ID: P-009-DNS
Abstract (EN): Eventual consistency is a relaxed consistency model used in large-scale distributed systems that seek better availability when consistency can be delayed. CRDTs are distributed data types that make eventual consistency of a distributed object possible and non ad-hoc. Specifically, state-based CRDTs achieve this through shipping the entire replica state that is, eventually, merged to other replicas ensuring conver- gence. This imposes a large communication overhead when the replica size or the number of replicas gets larger. In this work, we introduce a decomposable version of state-based CRDTs, called Delta State-based CRDTs (¿-CRDT). A ¿-CRDT is viewed as a join of multiple fine-grained CRDTs of the same type, called deltas (¿). The deltas are produced by applying ¿-mutators, on a replica state, which are mod- ified versions of the original CRDT mutators. This makes it possible to ship small deltas (or batches) instead of ship- ping the entire state. The challenges are to make the join of deltas equivalent to the join of the entire object in clas- sical state-based CRDTs, and to find a way to derive the ¿-mutators. We address this challenge in this work, and we explore the minimal requirements that a communication al- gorithm must offer according to the guarantees provided by the underlying messaging middleware. Copyright © 2007 by the Association for Computing Machinery, Inc.
Language: English
Type (Professor's evaluation): Scientific
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

Pure Operation-Based Replicated Data Types (2017)
Other Publications
Baquero, C; Almeida, PS; Shoker, A
Delta State replicated data types (2018)
Article in International Scientific Journal
Almeida, PS; Shoker, A; Baquero, C
Making operation-based CRDTs operation-based (2014)
Article in International Conference Proceedings Book
Baquero, C; Almeida, PS; Shoker, A
Making Operation-Based CRDTs Operation-Based (2014)
Article in International Conference Proceedings Book
Baquero, C; Almeida, PS; Shoker, A
Life Beyond Distributed Transactions on the Edge (2016)
Article in International Conference Proceedings Book
Shoker, A; Kassam, Z; Almeida, PS; Baquero, C

See all (10)

Recommend this page Top
Copyright 1996-2025 © Faculdade de Medicina Dentária da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-08-27 at 02:53:06 | Privacy Policy | Personal Data Protection Policy | Whistleblowing | Electronic Yellow Book