Extending Eventually Consistent Cloud Databases for Enforcing Numeric Invariants

March 31, 2015 Β· Declared Dead Β· πŸ› IEEE International Symposium on Reliable Distributed Systems

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Valter Balegas, Diogo Serra, SΓ©rgio Duarte, Carla Ferreira, Rodrigo Rodrigues, Nuno PreguiΓ§a, Marc Shapiro, Mahsa Najafzadeh arXiv ID 1503.09052 Category cs.DC: Distributed Computing Citations 41 Venue IEEE International Symposium on Reliable Distributed Systems Last Checked 6 months ago
Abstract
Geo-replicated databases often operate under the principle of eventual consistency to offer high-availability with low latency on a simple key/value store abstraction. Recently, some have adopted commutative data types to provide seamless reconciliation for special purpose data types, such as counters. Despite this, the inability to enforce numeric invariants across all replicas still remains a key shortcoming of relying on the limited guarantees of eventual consistency storage. We present a new replicated data type, called bounded counter, which adds support for numeric invariants to eventually consistent geo-replicated databases. We describe how this can be implemented on top of existing cloud stores without modifying them, using Riak as an example. Our approach adapts ideas from escrow transactions to devise a solution that is decentralized, fault-tolerant and fast. Our evaluation shows much lower latency and better scalability than the traditional approach of using strong consistency to enforce numeric invariants, thus alleviating the tension between consistency and availability.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Distributed Computing

Died the same way β€” πŸ‘» Ghosted