Building efficient and available distributed transaction with Paxos-based coding consensus

Supporting distributed transaction is a key function for large-scale database systems. Conventional database systems build distributed transactions on the top of replication storage to provide high availability. However, replication induces a large amount of storage overhead. In this paper, we make the first attempt to build highly available distributed transactions over erasure coding to achieve high storage efficiency. We propose Eunice, an Efficient and available distributed transaction protocol that Unifies Concurrency control and Erasure coding. In Eunice, we first design a single-layered coding update mechanism to optimize transaction latency. Then we propose a Paxos-based coding consensus protocol to provide fault-tolerance and strong consistency for coding update operation. Compare with conventional distributed transaction protocol with replication, Eunice can save up to 41.9% storage consumption, while achieving comparable throughput and latency performance.