Tunable consistency guarantees of selective data consistency model

Tunable consistency guarantees in big data stores help in achieving optimized consistency guarantees with improved performance. Commercial data stores offer tunable consistency guarantees at transaction level where the user specifies the desired level of consistency in terms of number of participating replicas in read and write consensus. Selective data consistency model applies strict consistency to a subset of data objects. The consistency guarantees of data attributes or objects are measured using an application independent metric called consistency index (CI). Our consistency model is predictive and helps in expression of data consistency as a function of known database design parameters, like workload characteristics and number of replicas of the data object. This work extends the causal relationships presented in our earlier work and presents adaptive consistency guarantees of this consistency model. The adaptive consistency guarantees are implemented with a consistency tuner, which probes the consistency index of an observed replicated data object in an online application. The tuner uses statistically derived threshold values of an optimum time gap, which, when padded in a workload stream, guarantees a desired value of consistency index for the observed data object. The tuner thus works like a workload scheduler of the replicated data object and pads only the required time delay between the requests in such a way that desired level of consistency is achieved with minimal effect on performance metrics like response time.

[1]  Amin Vahdat,et al.  Design and evaluation of a conit-based continuous consistency model for replicated services , 2002, TOCS.

[2]  B. Yegnanarayana,et al.  Artificial Neural Networks , 2004 .

[3]  Hong Jiang,et al.  Adaptive Consistency Guarantees for Large-Scale Replicated Services , 2008, 2008 International Conference on Networking, Architecture, and Storage.

[4]  Zhen Zhou,et al.  File heat-based Self-adaptive Replica Consistency Strategy for Cloud Storage , 2014, J. Comput..

[5]  Robert J. Schalkoff,et al.  Artificial neural networks , 1997 .

[6]  Andrew S. Tanenbaum,et al.  Distributed Systems , 2007 .

[7]  C. Walck Hand-book on statistical distributions for experimentalists , 1996 .

[8]  Henry Living,et al.  Review of: Seibold, Chris Mac OS X Snow Leopard. Pocket guide Sebastopol, CA: O'Reilly Media, Inc., 2009 , 2009, Inf. Res..

[10]  María S. Pérez-Hernández,et al.  Harmony: Towards Automated Self-Adaptive Consistency in Cloud Storage , 2012, 2012 IEEE International Conference on Cluster Computing.

[12]  Lars George,et al.  HBase: The Definitive Guide , 2011 .

[13]  Jennifer Widom,et al.  Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data , 2000, VLDB.

[14]  Ion Stoica,et al.  Probabilistically Bounded Staleness for Practical Partial Quorums , 2012, Proc. VLDB Endow..

[15]  David W. Hosmer,et al.  Applied Logistic Regression , 1991 .

[16]  Prashant J. Shenoy,et al.  Adaptive Leases: A Strong Consistency Mechanism for the World Wide Web , 2003, IEEE Trans. Knowl. Data Eng..

[17]  Eric A. Brewer,et al.  Towards robust distributed systems (abstract) , 2000, PODC '00.

[18]  Zheng Zhang,et al.  Trading replication consistency for performance and availability: an adaptive approach , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[19]  Gustavo Alonso,et al.  Consistency Rationing in the Cloud: Pay only when it matters , 2009, Proc. VLDB Endow..

[20]  D. Hosmer,et al.  Applied Logistic Regression , 1991 .

[21]  Ricardo Bianchini,et al.  Efficiently adapting to sharing patterns in software DSMs , 1998, Proceedings 1998 Fourth International Symposium on High-Performance Computer Architecture.

[22]  Sape J. Mullender,et al.  Distributed systems (2nd Ed.) , 1993 .