Abstract
Modern storage systems employing quorum replication are often configured to use partial, non-strict quorums to prioritize performance over consistency. These systems return the most recently changed data item only from a set of replicas to respond more quickly to a read request without guaranteeing that the data item is the most recently changed for all of the data. Because these partial quorum mechanisms provide only basic eventual consistency guarantees, with no limit on the freshness of the data returned, sometimes these configurations are not acceptable for certain applications. In this work, we have devised a new key-value store with partial quorums while ensuring bounded staleness. Our store reports the expected bounds on staleness with respect to wall clock. We evaluated our new key-value store with Yahoo! Cloud Service Benchmarks and show its performance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bailis, P., Venkataraman, S., Franklin, M.J., Hellerstein, J.M., Stoica, I.: Probabilistically Bounded Staleness for Practical Partial Quorums. In: Proceedings of the VLDB Endowment, vol. 5(8), pp. 776–787 (2012)
Vogels, W.: Eventually consistent. Communications of the ACM 52(1), 40–44 (2009)
Thomas, R.H.: A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems 4(2), 180–209 (1979)
Gifford, D.K.: Weighted voting for replicated data. In: Proceedings of the 7th ACM Symposium on Operating Systems, pp. 150–162. ACM, New York (1979)
Gilbert, S., Lynch, N.: Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services. ACM SIGACT News 33(2), 51–59 (2002)
Singla, A.: Temporal notions of synchronization and consistency in Beehive. In: Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 211–220 (1997)
Torres-Rojas, F.J., Ahamad, M., Raynal, M.: Timed consistency for shared distributed objects. In: Proceedings of the 18th ACM Symposium on Principles of Distributed Computing, pp. 163–172 (1999)
Zhang, C., Zhang, Z.: Trading replication consistency for performance and availability: an adaptive approach. In: Proceedings of the IEEE International Conference on Distributed Computing Systems, pp. 687–695 (2003)
Yu, H., Vahdat, A.: Design and evaluation of a conit-based continuous consistency model for replicated services. ACM Transactions on Computer Systems 20(3), 239–282 (2002)
Yu, H., Vahdat, A.: The costs and limits of availability for replicated services. ACM Transactions on Computer Systems 24(1), 70–113 (2006)
Krishnamurthy, S., Sanders, W.H., Cukier, M.: An adaptive quality of service aware middleware for replicated services. IEEE Transactions on Parallel and Distributed Systems 14(11), 1112–1125 (2003)
DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: Amazon’s highly available key-value store. In: Proceedings of the 26th ACM Symposium on Operating Systems Principles, pp. 205–220 (2007)
Rohm, U., Bohm, K., Schek, H.-J., Schuldt, H.: FAS - a freshness-sensitive coordination middleware for a cluster of OLAP components. In: Proceedings of the 28th Very Large Data Bases, pp. 754–765 (2002)
Guo, H., Larson, P.-A., Ramakrishnan, R., Goldstein, J.: Relaxed currency and consistency: how to say “good enough” in SQL. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 815–826 (2004)
Project Voldemort, http://project-voldemort.com/
Apache Cassandra, http://cassandra.apache.org/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Horii, H., Enoki, M., Onodera, T. (2014). A Distributed Quorum System for Ensuring Bounded Staleness of Key-Value Stores. In: Li, F., Li, G., Hwang, Sw., Yao, B., Zhang, Z. (eds) Web-Age Information Management. WAIM 2014. Lecture Notes in Computer Science, vol 8485. Springer, Cham. https://doi.org/10.1007/978-3-319-08010-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-08010-9_11
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08009-3
Online ISBN: 978-3-319-08010-9
eBook Packages: Computer ScienceComputer Science (R0)