Standard

Squirrel: an extensible distributed key-value store. / De Porre, Kevin; Gonzalez Boix, Elisa.

Proceedings of the 4th ACM SIGPLAN International Workshop on Meta-Programming Techniques and Reflection. 2019.

Research output: Chapter in Book/Report/Conference proceedingOther chapter contribution

Harvard

De Porre, K & Gonzalez Boix, E 2019, Squirrel: an extensible distributed key-value store. in Proceedings of the 4th ACM SIGPLAN International Workshop on Meta-Programming Techniques and Reflection. Proceedings of the 4th ACM SIGPLAN International Workshop on Meta-Programming Techniques and Reflection, Athens, Greece, 20/10/19.

APA

De Porre, K., & Gonzalez Boix, E. (2019). Squirrel: an extensible distributed key-value store. In Proceedings of the 4th ACM SIGPLAN International Workshop on Meta-Programming Techniques and Reflection

Vancouver

De Porre K, Gonzalez Boix E. Squirrel: an extensible distributed key-value store. In Proceedings of the 4th ACM SIGPLAN International Workshop on Meta-Programming Techniques and Reflection. 2019

Author

De Porre, Kevin ; Gonzalez Boix, Elisa. / Squirrel: an extensible distributed key-value store. Proceedings of the 4th ACM SIGPLAN International Workshop on Meta-Programming Techniques and Reflection. 2019.

BibTeX

@inbook{038e66dc116049238da6df96383f0b51,
title = "Squirrel: an extensible distributed key-value store",
abstract = "Distributed key-value (KV) stores are a rising alternative to traditional relational databases since they provide a flexible yet simple data model. Recent KV stores use eventual consistency to ensure fast reads and writes as well as high availability. Support for eventual consistency is however still very limited as typically only a handful of replicated data types are provided. Moreover, modern applications maintain various types of data, some of which require strong consistency whereas other require high availability. Implementing such applications remains cumbersome due to the lack of support for data consistency in today’s KV stores. In this paper we propose Squirrel, an open implementation of an in-memory distributed KV store. The core idea is to reify distribution through consistency models and protocols. We implement two families of consistency models (strong consistency and strong eventual consistency) and several consistency protocols, including two-phase commit and CRDTs.",
author = "{De Porre}, Kevin and {Gonzalez Boix}, Elisa",
year = "2019",
language = "English",
booktitle = "Proceedings of the 4th ACM SIGPLAN International Workshop on Meta-Programming Techniques and Reflection",

}

RIS

TY - CHAP

T1 - Squirrel: an extensible distributed key-value store

AU - De Porre, Kevin

AU - Gonzalez Boix, Elisa

PY - 2019

Y1 - 2019

N2 - Distributed key-value (KV) stores are a rising alternative to traditional relational databases since they provide a flexible yet simple data model. Recent KV stores use eventual consistency to ensure fast reads and writes as well as high availability. Support for eventual consistency is however still very limited as typically only a handful of replicated data types are provided. Moreover, modern applications maintain various types of data, some of which require strong consistency whereas other require high availability. Implementing such applications remains cumbersome due to the lack of support for data consistency in today’s KV stores. In this paper we propose Squirrel, an open implementation of an in-memory distributed KV store. The core idea is to reify distribution through consistency models and protocols. We implement two families of consistency models (strong consistency and strong eventual consistency) and several consistency protocols, including two-phase commit and CRDTs.

AB - Distributed key-value (KV) stores are a rising alternative to traditional relational databases since they provide a flexible yet simple data model. Recent KV stores use eventual consistency to ensure fast reads and writes as well as high availability. Support for eventual consistency is however still very limited as typically only a handful of replicated data types are provided. Moreover, modern applications maintain various types of data, some of which require strong consistency whereas other require high availability. Implementing such applications remains cumbersome due to the lack of support for data consistency in today’s KV stores. In this paper we propose Squirrel, an open implementation of an in-memory distributed KV store. The core idea is to reify distribution through consistency models and protocols. We implement two families of consistency models (strong consistency and strong eventual consistency) and several consistency protocols, including two-phase commit and CRDTs.

M3 - Other chapter contribution

BT - Proceedings of the 4th ACM SIGPLAN International Workshop on Meta-Programming Techniques and Reflection

ER -

ID: 48791949