Abstract
Database systems are widely used in many fields. As the scale of database systems increases, more firms decide to deploy the database system in a distributed environment for the sake of data integrity fault tolerance. For guaranteeing the consistency of data, database management systems adopt isolation policies. This paper discusses probabilistic models for snapshot isolation of database management system. Snapshot isolation is an effective method to enhance the consistency of database system, although it degrades the system performance where the system has large network latency such as distributed database system. Also, under the failure-prone environment, a restart scheme is considered as one countermeasure. This paper proposes probabilistic models for the dynamics of snapshot isolation of database system and exhibits the optimization of system performance with respect to updating interval of snapshot isolation within the failure-prone environment from the analytical point of view. Numerical experiments are conducted to validate the effectiveness of analytical results by using real traffic data.
Similar content being viewed by others
References
Berenson H, Bernstein P, Gray J, Melton J, O’Neil E, O’Neil P (1995) A critique of ANSI SQL isolation levels. In: Proceedings of the SIGMOD International Conference on Management of Data. ACM Press, New York, pp 1–10
Bernabé-Gisbert JM, Zuikevičiūtė, V (2008) A probabilistic analysis of snapshot isolation with partial replication. In: Proceedings of the 2008 Sympoisum on Reliable Distributed Systems (SRDS-2008). IEEE CS Press, Naples, pp 249–258
Chervenak A, Foster I, Kesselman C, Salisbury C, Tuecke S (2000) The data grid: towards an architecture for the distributed management and analysis of large scientific datasets. J Netw Comput Appl 23:187–200
Elnikety S, Pedone F, Zwaenepoel W (2005) Database replication using generalized snapshot isolation. In: Proceedings of the 2005 Symposium on reliable distributed systems (SRDS-2005). IEEE CS Press, pp 73–84
Gaver DP (1966) Observing stochastic processes, and approximate transform inversion. Oper Res 14(3):444–459
Graham R, Choi SE, Daniel D, Desai N, Minnich R, Rasmussen C, Risinger L, Sukalski M (2003) A network-failure-tolerant message-passing system for terascale clusters. Int J Parallel Program 31(4):285–303
Gray J, Reuter A (1992) Transaction processing: concepts and techniques, 1st edn. Morgan Kaufmann Publishers Inc., San Francisco
Hsieh I, Chang FM, Kao SJ et al (2012) A slot-based bs scheduling with maximum latency guarantee and capacity first in 802.16 e networks. Int J Commun Systems 25(2):55–66
Luo C, Okamura H, Dohi T (2012) Model-based performance optimization of generalized snapshot isolation in database system. In: Ubiquitous Intelligence Computing and 9th International Conference on Autonomic Trusted Computing (UIC/ATC), 2012 9th International Conference on, pp 494–500. doi:10.1109/UIC-ATC.2012.129
van Moorsel A, Wolter K (2004) Analysis and algorithms for restart. In: Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings. First International Conference on the, pp 195–204. doi:10.1109/QEST.2004.1348034
van Moorsel A, Wolter K (2006) Analysis of restart mechanisms in software systems. IEEE Trans Softw Eng 32(8):547–558. doi:10.1109/TSE.2006.73
Özsu T, Valduriez P (2011) Principles of distributed database systems. Computer science. Springer, Berlin
Padhye V, Tripathi A (2012) Scalable transaction management with snapshot isolation on cloud data management systems. In: Cloud computing (CLOUD), 2012 IEEE 5th International Conference on, pp 542–549. doi:10.1109/CLOUD.2012.102
Ramesh D, Jain A, Kumar C (2012) Implementation of atomicity and snapshot isolation for multi-row transactions on column oriented distributed databases using rdbms. In: Communications, devices and intelligent systems (CODIS), 2012 International Conference on, pp 298–301. doi:10.1109/CODIS.2012.6422197
Ross SM (1970) Applied probability models with optimization applications. Holden-Day, San Francisco
Valko PP, Abate J (2004) Comparison of sequence accelerators for the gaver method of numerical laplace transform inversion. Comput Math Appl 48(3):629–636
Acknowledgments
This research was partially supported by the Ministry of Education, Science, Sports and Culture, Grant-in-Aid for Scientific Research (C), Grant Nos. 23510171 (2011–2013) and 23500047 (2011–2013). This paper is an extension of work originally reported in IEEE 9th International Conference on Autonomic Trusted Computing (ATC) 2012, Sept. [9].
Author information
Authors and Affiliations
Corresponding author
Appendix: Numerical inverse Laplace transform
Appendix: Numerical inverse Laplace transform
Generally, since the LS transform \(F^*(s)\) can be reduced to the Laplace transform by multiplying the LS transform by \(1/s\), we can apply numerical inverse Laplace transform techniques to obtain the inverse LS transfrom. In this paper, we use Gaver’s method [5] to obtain the inverse LS transform of \(G^*(s)\).
Gaver’s method is based on the following formulas:
where \(\delta (t)\) is the Dirac delta function. By taking appropriate sequence \(p_n(t)\), the left-hand side of Eq. (42) corresponds to the Laplace transform. Concretely, Gaver proposed the following sequence:
where \(n/m=c\) and \(a=\log (1+c)/\tau \). Letting
we have the following recurrence formula:
where \(f^*(s)\) is the Laplace transform. In our numerical experiment, we use an improved Gaver’s method that is accelerated by Wynn’s rho algorithm [16].
Rights and permissions
About this article
Cite this article
Luo, C., Okamura, H. & Dohi, T. Performance evaluation of snapshot isolation in distributed database system under failure-prone environment. J Supercomput 70, 1156–1179 (2014). https://doi.org/10.1007/s11227-014-1162-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-014-1162-5