Shegufta Bakht Ahsan
ABSTRACT
We argue that transactional distributed database/storage systems need to view the impossibility theorem in terms of the contention, abort rate, and throughput, rather than via the traditional CAP theorem. Motivated by Jim Gray, we state a new impossibility theorem, which we call the CAT theorem (Contention-Abort-Throughput). We present experimental results from the performance of several transactional systems w.r.t. the CAT impossibility spectrum.
- Amazon RDS MySQL. https://aws.amazon.com/rds/mysql/. Last accessed May 2016.Google Scholar
- Emulab. https://www.emulab.net/. Last accessed May 2016.Google Scholar
- MongoDB. https://www.mongodb.org/. Last accessed May 2016.Google Scholar
- Ms azure SQL. https://azure.microsoft.com/en-us/services/sql-database/. Last accessed May 2016.Google Scholar
- Riak. http://basho.com/products/. Last accessed May 2016.Google Scholar
- Abadi, D. Consistency tradeoffs in modern distributed database system design: CAP is only part of the story. IEEE Computer 45, 2 (2012), 37--42. Google ScholarDigital Library
- Aguilera, M. K., Leners, J. B., and Walfish, M. Yesquel: Scalable SQL storage for web applications. In Proceedings of the 25th Symposium on Operating Systems Principles (2015), SOSP '15. Google ScholarDigital Library
- Bailis, P., Davidson, A., Fekete, A., Ghodsi, A., Hellerstein, J. M., and Stoica, I. Highly available transactions: Virtues and limitations. Proc. VLDB Endow. 7, 3 (Nov. 2013), 181--192. Google ScholarDigital Library
- Brewer, E. CAP twelve years later: How the "rules" have changed. IEEE Computer 45, 2 (2012), 23--29. Google ScholarDigital Library
- Brewer, E. A. A certain freedom: thoughts on the CAP theorem. In Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC'10. Google ScholarDigital Library
- Brewer, E. A. Towards robust distributed systems (invited talk). In Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing (2000), PODC '00, ACM. Google ScholarDigital Library
- Cooper, B. F., Silberstein, A., Tam, E., Ramakrishnan, R., and Sears, R. Benchmarking cloud serving systems with YCSB. In Proceedings of the First ACM Symposium on Cloud Computing (2010), SoCC '10, ACM, pp. 143--154. Google ScholarDigital Library
- Coulouris, G., Dollimore, J., Kindberg, T., and Blair, G. Distributed Systems: Concepts and Design, 5th ed. Addison-Wesley Publishing Company, 2011. Google ScholarDigital Library
- DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., and Vogels, W. Dynamo: Amazon's highly available key-value store. In Proceedings of the 21st ACM Symposium on Operating Systems Principles 2007. Google ScholarDigital Library
- Dey, A., Fekete, A., Nambiar, R., and Röhm, U. YCSB+T: benchmarking web-scale transactional databases. In Workshops Proceedings of the Thirtieth International Conference on Data Engineering Workshops, Chicago, IL, USA, March 31 - April 4 (2014), ICDE '14, pp. 223--230.Google ScholarCross Ref
- Dragojević, A., Narayanan, D., Nightingale, E. B., Renzelmann, M., Shamis, A., Badam, A., and Castro, M. No compromises: Distributed transactions with consistency, availability, and performance. In Proceedings of the 25th Symposium on Operating Systems Principles (2015), SOSP '15. Google ScholarDigital Library
- Escriva, R., Wong, B., and Sirer, E. G. Warp: Lightweight multi-key transactions for key-value stores. Computing Research Repository.Google Scholar
- Faleiro, J. M., and Abadi, D. J. FIT: A distributed database performance tradeoff. IEEE Data Eng. Bulletin 38, 1 (2015), 10--17.Google Scholar
- Gilbert, S., and Lynch, N. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services. ACM Special Interest Group on Algorithms and Computation Theory 33, 2 (June 2002), 51--59. Google ScholarDigital Library
- Gilbert, S., and Lynch, N. A. Perspectives on the CAP theorem. IEEE Computer 45, 2 (2012), 30--36. Google ScholarDigital Library
- Gray, J., Helland, P., O'Neil, P. E., and Shasha, D. The dangers of replication and a solution. In Proceedings of the 1996 ACM Special Interest Group on Management of Data, Montreal, Quebec, Canada, June 4-6, 1996. (1996), SIGMOD '96, pp. 173--182. Google ScholarDigital Library
- Kung, H. T., and Robinson, J. T. On optimistic methods for concurrency control. ACM Transaction on Database Systems 6, 2 (1981), 213--226. Google ScholarDigital Library
- Lakshman, A., and Malik, P. Cassandra: a decentralized structured storage system. Operating Systems Review 44, 2 (2010), 35--40. Google ScholarDigital Library
- Lee, C., Park, S. J., Kejriwal, A., Matsushita, S., and Ousterhout, J. Implementing linearizability at large scale and low latency. In Proceedings of the 25th Symposium on Operating Systems Principles (2015), SOSP '15, ACM, pp. 71--86. Google ScholarDigital Library
- Li, C., Porto, D., Clement, A., Gehrke, J., Preguiça, N., and Rodrigues, R. Making geo-replicated systems fast as possible, consistent when necessary. In Proceedings of the Tenth USENIX Conference on Operating Systems Design and Implementation (2012), OSDI'12. Google ScholarDigital Library
- Lloyd, W., Freedman, M. J., Kaminsky, M., and Andersen, D. G. Don't settle for eventual: Scalable causal consistency for wide-area storage with COPS. In Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles (2011), SOSP '11, ACM, pp. 401--416. Google ScholarDigital Library
- Sirer, E. G. Why CAP is flawed and what this means for next generation data stores. LADIS, 2015.Google Scholar
- Wei, X., Shi, J., Chen, Y., Chen, R., and Chen, H. Fast in-memory transaction processing using RDMA and HTM. In Proceedings of the 25th Symposium on Operating Systems Principles (2015), SOSP '15, ACM, pp. 87--104. Google ScholarDigital Library
- Xie, C., Su, C., Littley, C., Alvisi, L., Kapritsos, M., and Wang, Y. High-performance ACID via modular concurrency control. In Proceedings of the 25th Symposium on Operating Systems Principles (2015), SOSP '15, ACM, pp. 279--294. Google ScholarDigital Library
- Zhang, I., Sharma, N. K., Szekeres, A., Krishnamurthy, A., and Ports, D. R. K. Building consistent transactions with inconsistent replication. In Proceedings of the 25th Symposium on Operating Systems Principles (2015), SOSP '15. Google ScholarDigital Library
Recommendations
ALOHA-KV: high performance read-only and write-only distributed transactions
SoCC '17: Proceedings of the 2017 Symposium on Cloud ComputingThere is a trend in recent database research to pursue coordination avoidance and weaker transaction isolation under a long-standing assumption: concurrent serializable transactions under read-write or write-write conflicts require costly ...
On high performance distributed transactional data structures
MiddlewareDPT '13: Proceedings Demo & Poster Track of ACM/IFIP/USENIX International Middleware ConferenceWe present three protocols for developing high performance distributed transactional data structures. Our first protocol, QR-ON, incorporates the open nesting transactional model into QR, a quorum-based protocol for managing concurrency on distributed ...
Reducing Aborts in Distributed Transactional Systems through Dependency Detection
ICDCN '15: Proceedings of the 16th International Conference on Distributed Computing and NetworkingExisting distributed transactional system execution model based on globally-consistent contention management policies may abort many transactions that could potentially commit without violating correctness. To reduce unnecessary aborts and increase ...
Comments