2014 IEEE 33rd International Symposium on Reliable Distributed Systems (SRDS) (2014)
Oct. 6, 2014 to Oct. 9, 2014
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SRDS.2014.43
In this paper we describe the design and implementation of ACaZoo, a key-value store that combines strong consistency with high performance and high availability. ACaZoo supports the popular column-oriented data model of Apache Cassandra and HBase. It implements strongly-consistent data replication using primary-backup atomic broadcast of a write-ahead log, which records data mutations to a Log-structured Merge Tree (LSM-Tree). ACaZoo scales by horizontally partitioning the key space via consistent primary-key hashing on available replica groups (RGs). LSM-Tree compactions can hamper performance, especially when they take place at RG primaries. ACaZoo addresses this problem by changing RG leadership prior to heavy compactions, a method that can improve throughput by up to 40% in write-intensive workloads. We evaluate ACaZoo using the Yahoo Cloud Serving Benchmark (YCSB) and compare it to Oracle's NoSQL Database and to Cassandra providing serial consistency via an extension of the Paxos algorithm.
Compaction, Nominations and elections, Servers, Proposals, Protocols, Data models, Databases
P. Garefalakis, P. Papadopoulos and K. Magoutis, "ACaZoo: A Distributed Key-Value Store Based on Replicated LSM-Trees," 2014 IEEE 33rd International Symposium on Reliable Distributed Systems (SRDS), Nara, Japan, 2014, pp. 211-220.