Cookies Policy
We use cookies to improve our site and your experience. By continuing to browse our site you accept our cookie policy. Find out More
Close
  • Menu
About

About

My research interests cover data management in eventual consistent settings, distributed data aggregation and causality tracking. In the last years I have collaborated with my co-authors in the development of data summary mechanisms such as Scalable Bloom Filters, causality tracking for dynamic settings with Interval Tree Clocks and Dotted Version Vectors and in predictable eventual consistency with Conflict-Free Replicated Data Types. My recent work has been applied in the Riak distributed database and in Akka distributed data, and is running in production systems serving millions of users worldwide.

Interest
Topics
Details

Details

  • Name

    Carlos Baquero
  • Cluster

    Computer Science
  • Role

    Area Manager
  • Since

    01st November 2011
003
Publications

2019

Scalable eventually consistent counters over unreliable networks

Authors
Almeida, PS; Baquero, C;

Publication
Distributed Computing

Abstract

2019

Conflict-Free Replicated Data Types CRDTs

Authors
Preguiça, NM; Baquero, C; Shapiro, M;

Publication
Encyclopedia of Big Data Technologies.

Abstract

2019

Efficient synchronization of state-based CRDTs

Authors
Enes, V; Almeida, PS; Baquero, C; Leitao, J;

Publication
Proceedings - International Conference on Data Engineering

Abstract
To ensure high availability in large scale distributed systems, Conflict-free Replicated Data Types (CRDTs) relax consistency by allowing immediate query and update operations at the local replica, with no need for remote synchronization. State-based CRDTs synchronize replicas by periodically sending their full state to other replicas, which can become extremely costly as the CRDT state grows. Delta-based CRDTs address this problem by producing small incremental states (deltas) to be used in synchronization instead of the full state. However, current synchronization algorithms for delta-based CRDTs induce redundant wasteful delta propagation, performing worse than expected, and surprisingly, no better than state-based. In this paper we: 1) identify two sources of inefficiency in current synchronization algorithms for delta-based CRDTs; 2) bring the concept of join decomposition to state-based CRDTs; 3) exploit join decompositions to obtain optimal deltas and 4) improve the efficiency of synchronization algorithms; and finally, 5) experimentally evaluate the improved algorithms. © 2019 IEEE.

2019

Efficient Synchronization of State-based CRDTs

Authors
Enes, V; Almeida, PS; Baquero, C; Leitao, J;

Publication
2019 IEEE 35TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2019)

Abstract
To ensure high availability in large scale distributed systems, Conflict-free Replicated Data Types (CRDTs) relax consistency by allowing immediate query and update operations at the local replica, with no need for remote synchronization. State-based CRDTs synchronize replicas by periodically sending their full state to other replicas, which can become extremely costly as the CRDT state grows. Delta-based CRDTs address this problem by producing small incremental states (deltas) to be used in synchronization instead of the full state. However, current synchronization algorithms for delta-based CRDTs induce redundant wasteful delta propagation, performing worse than expected, and surprisingly, no better than state-based. In this paper we: 1) identify two sources of inefficiency in current synchronization algorithms for delta-based CRDTs; 2) bring the concept of join decomposition to state-based CRDTs; 3) exploit join decompositions to obtain optimal deltas and 4) improve the efficiency of synchronization algorithms; and finally, 5) experimentally evaluate the improved algorithms.

2019

Higher-order patterns in replicated data types

Authors
Leijnse, A; Almeida, PS; Baquero, C;

Publication
Proceedings of the 6th Workshop on Principles and Practice of Consistency for Distributed Data, PaPoC 2019

Abstract
The design of Conflict-free Replicated Data Types traditionally requires implementing new designs from scratch to meet a desired behavior. Although there are composition rules that can guide the process, there has not been a lot of work explaining how existing data types relate to each other, nor work that factors out common patterns. To bring clarity to the field we explain underlying patterns that are common to flags, sets, and registers. The identified patterns are succinct and composable, which gives them the power to explain both current designs and open up the space for new ones. © 2019 Copyright held by the owner/author(s). Publication rights licensed to ACM.

Supervised
thesis

2017

Efficient Synchronization of state-based CRDTs

Author

Institution
UM

2017

Sensing, coordination and actuation in office spaces

Author

Institution
UM

2017

Broadcast Cancellation in Unstructured Networks

Author
Rui Manuel Dias Ferreira Lima

Institution
UM

2016

Optimizing Operation-based Conflict-free Replicated Data Types

Author
Georges Younes

Institution
UM

2016

Broadcast Cancellation

Author
Rui Manuel Dias Ferreira Lima

Institution
UM