• Publication
  • 1991
  • Issue No. 2 - June
  • Abstract - Analysis of the Probability of Transaction Abort and Throughput of Two Timestamp Ordering Algorithms for Database Systems
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Analysis of the Probability of Transaction Abort and Throughput of Two Timestamp Ordering Algorithms for Database Systems
June 1991 (vol. 3 no. 2)
pp. 261-266

The author analyzes and compares the performance of two timestamp ordering concurrency control algorithms, namely, the basic and multiversion, for database systems. The multiversion algorithm improves the performance of the basic timestamp ordering algorithm by keeping multiple versions of data objects. The author discusses the performance enhancement in the multiversion algorithm over the basic algorithm. The author also discusses the storage overhead due to multiple versions of data objects in the multiversion algorithm. The exact performance model of these algorithms is so complex that it is impossible to find a closed-form solution. The author reduces the complexity of the analysis by analyzing a single transaction in isolation and reflects the presence of other transactions on the isolated transaction by the probability of conflict/abort. The analysis provides useful insight into the performance of these algorithms.

[1] P. Bernstein and N. Goodman, "Timestamp based algorithms for concurrency control in distributed database systems," inProc. 6th Int. Conf. Very Large Database, Oct. 1980, pp. 285-300.
[2] P. Bernstein and N. Goodman, "Concurrency Control in Distributed Database Systems,"ACM Computing Surveys, Vol. 13, No. 2, June 1981, pp. 185-221.
[3] K. M. Chandy, U. Herzog, and L. Wu, "Parametric analysis of queueing networks,"IBM J. Res. Develop., pp. 36-42, Jan. 1975.
[4] A. Chesnais, E. Gelenbe, and I. Mitrani, "On the modeling of parallel access to shared data,"Commum. ACM, vol. 26, no. 3., pp. 196-202, Mar. 1983.
[5] D. M. Dias, B. R. Iyer, J. T. Robinson, and P. S. Yu, "Design and analysis of integrated concurrency-coherency controls," inProc. 13th Int. Conf. Very Large Data Bases, Brighton, UK, Sept. 1987, pp. 463-471.
[6] B. I. Galler, "Concurrency control performance issues," Ph.D. thesis, Comput. Sci. Dept., Univ. Toronto, Sept. 1982.
[7] H. Garcia-Molina, "Performance of update algorithms for replicated data in a distributed database," Ph. D. dissertation, Computer Science Dept., Stanford Univ., June 1979.
[8] F. Kamoun, L. Kleinrock, and R. Muntz, "Queueing analysis of the ordering issues in a distributed database concurrency control mechanism," inProc. Second Int. Conf. Distributed Comput. Syst., 1981, pp. 13-23.
[9] L. Kleinrock,Queueing Systems, Vol. 1: Theory. New York: Wiley 1975.
[10] S. Lavenberg, "A simple analysis of exclusive and shared lock contention in a database system,"Perform. Eval. Rev., (Proc. 1984 ACM SIGMETRICS Conf., vol. 12, no. 3, pp. 143-148.
[11] V. O. K. Li, "Performance models of timestamp-ordering concurrency control algorithms in distributed database,"IEEE Trans. Comput., pp. 1041-1051, Sept. 1987.
[12] D.A. Menasce and T. Nakanishi, "Optimistic versus pessimistic concurrency control mechanisms in database management systems,"Inform. Syst.vol. 7, no. 1, pp. 13-27, 1982.
[13] K. H. Pun and G. G. Belford, "Performance study of two-phase locking in single-site database systems,"IEEE Trans. Software Eng., SE-13, pp. 1311-1328, Dec. 1987.
[14] M. Singhal, and A. K. Agrawala, "Performance analysis of an algorithm for concurrency control in replicated database systems,"Perform. Eval. Rev., vol. 14, no. 1, May 1986.
[15] M. Singhal "Performace analysis of the basic timestamp ordering algorithm via Markov modeling," Ohio State Univ. Tech. Rep. CISRC- 8/8-TR28, Aug. 1988.
[16] M. Singhal, "Performance analysis of an optimistic concurrency algorithm in replicated database systems," inProc. 17th Int. Conf. Parallel Processing, Chicago, IL, Aug. 1988, pp. 186-189.
[17] Y. C. Tay, "A mean value performance model for locking in databases," Ph.D. dissertation, Harvard Univ., Cambridge, MA, Feb. 1984.
[18] Y.C. Tay, N. Goodman, and R. Suri, "Locking performance in centralized databases,"ACM Trans. Database Syst., vol. 10, no. 4, pp. 415-462, Dec. 1985.
[19] A. Thomasian and I. K. Ryu, "A decomposition solution of the queueing network model the centralized DBMS with static locking," inProc. 1983 ACM SIGMETRICS Conf. Computer Performance Modeling, Measurement and Evaluation, Minneapolis, MN, Aug. 1983, pp. 82-92.
[20] A. Thomasian, "Performance evaluation of centralized databases with static locking,"IEEE Trans. Software Eng., vol. SE-11, no. 4, Apr. 1985.
[21] A. Thomasian and I. K. Ryu, "Analysis of some optimistic concurrency control schemes based on certification,"Perform. Eval. Rev., vol. 13, no. 2, pp. 192-203, 1985.
[22] R. J. T. Wong and W.S. Morris, "Performance analysis of locking and optimistic concurrency control algorithms,"Perform. Eval., 5, pp. 105-118, North-Holland, 1985.

Index Terms:
transaction abort; timestamp ordering algorithms; database systems; timestamp ordering concurrency control algorithms; multiversion algorithm; basic timestamp ordering algorithm; performance enhancement; storage overhead; multiversion algorithm; exact performance model; closed-form solution; conflict/abort; concurrency control; distributed databases; transaction processing
Citation:
M. Singhal, "Analysis of the Probability of Transaction Abort and Throughput of Two Timestamp Ordering Algorithms for Database Systems," IEEE Transactions on Knowledge and Data Engineering, vol. 3, no. 2, pp. 261-266, June 1991, doi:10.1109/69.88007
Usage of this product signifies your acceptance of the Terms of Use.