This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Performance Analysis of Dynamic Finite Versioning Schemes: Storage Cost vs. Obsolescence
December 1996 (vol. 8 no. 6)
pp. 985-1001

Abstract—Dynamic finite versioning (DFV) schemes are an effective approach to concurrent transaction and query processing, where a finite number of consistent, but maybe slightly out-of-date, logical snapshots of the database can be dynamically derived for query access. In DFV, the storage overhead for keeping additional versions of changed data to support the logical snapshots and the amount of obsolescence faced by queries are two major performance issues. In this paper, we analyze the performance of DFV, with emphasis on the trade-offs between the storage cost and obsolescence. We develop analytical models based on a renewal-process approximation to evaluate the performance of DFV using M≥ 2 snapshots. Asymptotic closed-form results for high query arrival rates are given for the case of two snapshots. Simulation is used to validate the analytical models and to evaluate the trade-offs between various strategies for advancing snapshots when M > 2. The results show that 1) the analytical models match closely with simulation; 2) both the storage cost and obsolescence are sensitive to the snapshot-advancing strategies, especially for M > 2 snapshots; and 3) generally speaking, increasing the number of snapshots demonstrates a trade-off between storage overhead and query obsolescence. For cases with skewed access or low update rates, a moderate increase in the number of snapshots beyond two can substantially reduce the obsolescence, while the storage overhead may increase only slightly, or even decrease in some cases. Such a reduction in obsolescence is more significant as the coefficient of variation of the query length distribution becomes larger. Moreover, for very low update rates, a large number of snapshots can be used to reduce the obsolescence to almost zero without increasing the storage overhead.

[1] H. Pirahesh,C. Mohan,J. Cheng,T.S. Liu,, and P. Selinger,“Parallelism in relational data base systems: Architectural issues and design approaches,” Proc. Second Int’l Symp. Databases in Parallel and Distributed Systems, pp. 4-29, July 1990.
[2] C. Pu, C.H. Hong, and J.M. Wha, "Performance Evaluation of Global Reading of Entire Databases," Proc. First Int'l Symp. Databases in Parallel and Distributed Systems, pp. 167-176, 1988.
[3] C. Pu, "On-the-Fly, Incremental, Consistent Reading of Entire Databases," Algorithmica, vol. 1, no. 3, pp. 271-287, Oct. 1986.
[4] M.J. Carey and W.A. Mouhanna, "The Performance of Multiversion Concurrency Control Algorithms," ACM Trans. Computer Systems, vol. 4, no. 4, pp. 338-378, Nov. 1986.
[5] D.J. Haderle and R.D. Jackson, "IBM Database 2 Overview," IBM Systems J., vol. 23, no. 2, pp. 112-125, 1984.
[6] K.-L. Wu, P.S. Yu, and C. Pu, Divergence Control for Epsilon-Serializability Proc. Eighth Int'l Conf. Data Eng., pp. 506-515, 1992.
[7] C. Pu and A. Leff, "Replica Control in Distributed Systems: An Asynchronous Approach," Proc. ACM SIGMOD Int'l Conf. Management Data, pp. 377-386, 1991.
[8] P.A. Bernstein and N. Goodman, “Multiversion Concurrency Control-Theory and Algorithms,” ACM Trans. Database Systems, vol. 8, no. 4, pp. 465-483, Dec. 1983.
[9] P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
[10] R. Bayer, H. Heller, and A. Reiser, “Parallelism and Recovery in Database Systems,” ACM Trans. Database Systems, vol. 5, no. 2, pp. 139-156, June 1980.
[11] D. Agrawal and S. Sengupta, "Modular Synchronization in Multiversion Databases: Version Control and Concurrency Control," Proc. SIGMOD Conf., 1989.
[12] A. Chan, S. Fox, W. Lin, A. Nori, and D. Ries, "The Implementation of an Integrated Concurrency Control and Recovery Scheme," Proc. ACM SIGMOD Conf., 1982.
[13] A. Chan and R. Gray, "Implementing Distributed Read-Only Transactions," IEEE Trans. Software Eng., vol. 11, no. 2, pp. 205-212, Feb. 1985.
[14] D Reed, "Implementing Atomic Actions on Decentralized Data," ACM Trans. Computer Systems, vol. 1, no. 1, Feb. 1983.
[15] W.E. Weihl, Distributed Version Management of Read-Only Actions IEEE Trans. Software Eng., vol. 13, no. 1, pp. 55-64, Jan. 1987.
[16] P. Bober and M. Carey, "On Mixing Queries and Transactions Via Multiversion Locking," Proc. Eighth IEEE Data Eng. Conf., 1992.
[17] D.M. Dias, A. Goyal, and F.N. Parr, "An Intelligent Page Store for Concurrent Transaction and Query Processing," Proc. Second Int'l Workshop Research Issues on Data Eng.: Transaction and Query Processing, pp. 12-19, 1992.
[18] C. Mohan, H. Pirahesh, and R. Lorie, “Efficient and Flexible Methods for Transient Versioning of Records to Avoid Locking by Read-Only Transactions,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 124–133, June 1992.
[19] K.-L. Wu, P.S. Yu, and M.-S. Chen, "Dynamic Finite Versioning: An Effective Versioning Approach to Concurrent Transaction and Query Processing," Proc. Int'l Conf. Data Eng., pp. 577-586, 1993.
[20] A. Merchant, K.-L. Wu, P.S. Yu, and M.-S. Chen, "Performance Analysis of Dynamic Finite Versioning for Concurrent Transaction and Query Processing," Proc. 1992 ACM SIGMETRICS and PERFORMANCE '92, pp. 103-114, 1992.
[21] T. Haerder and A. Reuter,“Principles of transaction-oriented database recovery,” ACM Computing Surveys, vol. 15, no. 4, pp. 287-317, Dec. 1983.
[22] L. Kleinrock, Queueing Systems, vol. I: Theory. John Wiley&Sons, 1975.
[23] K.S. Trivedi, Probability and Statistics with Reliability, Queuing, and Computer Science Applications. Prentice Hall, 1982.
[24] D.E. Knuth, The Art of Computer Programming, vol. 1,Addison Wesley, second ed. 1973.
[25] N.L. Johnson and S. Kotz, Continuous Univariate Distributions-1. Houghton Mifflin Co., 1970.
[26] S. Karlin and H.M. Taylor, A First Course in Stochastic Processes. Academic Press, 1975.
[27] E. Gumbel, Statistics of Extremes. Columbia Univ. Press, 1958.
[28] S. Ross, Stochastic Processes. John Wiley&Sons, 1982.
[29] P.M. Bober and D.M. Dias, "Storage Cost Tradeoffs for Multiversion Concurrency Control," Technical Report RC 18367, IBM T.J. Watson Research Center, Jan. 1992.

Index Terms:
Multiple versions, transaction processing, concurrent transaction and query processing, analytical modeling, renewal process, two-moment approximation, and dynamic finite versioning.
Citation:
Arif Merchant, Kun-Lung Wu, Philip S. Yu, Ming-Syan Chen, "Performance Analysis of Dynamic Finite Versioning Schemes: Storage Cost vs. Obsolescence," IEEE Transactions on Knowledge and Data Engineering, vol. 8, no. 6, pp. 985-1001, Dec. 1996, doi:10.1109/69.553167
Usage of this product signifies your acceptance of the Terms of Use.