Abstract
Application programmers increasingly prefer distributed storage systems with strong consistency and distributed transactions (e.g., Google's Spanner) for their strong guarantees and ease of use. Unfortunately, existing transactional storage systems are expensive to use - in part because they require costly replication protocols, like Paxos, for fault tolerance. In this paper, we present a new approach that makes transactional storage systems more affordable: we eliminate consistency from the replication protocol while still providing distributed transactions with strong consistency to applications. We present TAPIR - the Transactional Application Protocol for Inconsistent Replication - the first transaction protocol to use a novel replication protocol, called inconsistent replication, that provides fault tolerance without consistency. By enforcing strong consistency only in the transaction protocol, TAPIR can commit transactions in a single round-trip and order distributed transactions without centralized coordination. We demonstrate the use of TAPIR in a transactional key-value store, TAPIR-KV. Compared to conventional systems, TAPIR-KV provides better latency and throughput.
Cite
CITATION STYLE
Zhang, I., Sharma, N. K., Szekeres, A., Krishnamurthy, A., & Ports, D. R. K. (2015). Building consistent transactions with inconsistent replication. In SOSP 2015 - Proceedings of the 25th ACM Symposium on Operating Systems Principles (pp. 263–278). Association for Computing Machinery, Inc. https://doi.org/10.1145/2815400.2815404
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.