This Article 
 Bibliographic References 
 Add to: 
Analysis of Hybrid Concurrency Control Schemes for a High Data Contention Environment
February 1992 (vol. 18 no. 2)
pp. 118-129

Analytical models are developed to study hybrid CC (concurrency control) schemes which employ a different CC scheme to handle rerun transactions, since their characteristics are different from the first run of transactions. These include switching to static or dynamic locking during rerun (referred to as static and dynamic hybrid OCC (optimistic concurrency control) schemes, respectively), and switching to broadcast OCC during rerun, while doing pure OCC for the first run. In a high data contention environment where locking is inferior to OCC, analysis shows that the performance can be substantially improved by using this hybrid approach and the authors study the tradeoff of the different hybrid CC schemes. The analytic models are based on a decomposition approach and use a mean-value-type analysis. The accuracy of the analysis is validated through simulations.

[1] R. Agrawal, M. J. Carey, and M. Linvy, "Concurrency control performance modelling: Alternatives and implications,"ACM Trans. Database Syst., vol. 12, pp. 609-654, Dec. 1987.
[2] P.A. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, Mass., 1987.
[3] W. Cellary, E. Gelenbe, and T. Morzy,Concurrency Control in Distributed Database Systems. Amsterdam:North Holland, 1988.
[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] B. Ciciani, D. M. Dias, and P. S. Yu, "Analysis of replication in distributed database systems,"IEEE Trans. Knowledge Data Eng., vol. 2, pp. 247-261, June 1990.
[6] B. Ciciani, D.M. Dias, B.R. Iyer, and P.S. Yu, "A hybrid distributed-centralized system structure for transaction processing,"IEEE Trans. Software Eng., vol. 16, pp. 791-806, Aug. 1990.
[7] M. J. Carey and M. Livny, "Distributed concurrency control performance: A study of algorithms, distribution, and replication," inProc. 14th Int. Conf. Very Large Data Bases, 1988.
[8] E.G. Coffman, E. Gelenbe, and B. Plateau, "Optimization of the number of copies in a distributed system,"IEEE Trans. Software Eng., vol. SE-7, pp. 78-84, Jan. 1981.
[9] A. Dan, D. F. Towsley, and W. H. Kohler, "Modeling the effects of data and resource contention on the performance of optimistic concurrency control protocols," inProc. 4th Int. Conf. on Data Eng.(Los Angeles, CA), Feb. 1988, pp. 418-425.
[10] A. Dan, D. M. Dias, and P.S. Yu, "Database buffer model for the data sharing environment," inProc. 6th Int. Conf. on Data Eng.(Los Angeles, CA), Feb. 1990, pp. 538-544.
[11] D.M. Dias, B.R. Iyer, and P.S. Yu, "Trade-offs between coupling small and large processors for transaction processing,"IEEE Trans. Computers, vol. 37, pp. 310-320, Mar. 1988.
[12] C. J. Date,An Introduction to Database Systems, vols. 1 and 2. Reading, MA: Addison-Wesley, vol. 1, 1981, vol. 2, 1983.
[13] P. Franaszek and J. T. Robinson, "Limitations on concurrency in transaction processing,"ACM Trans. Database Systems, vol. 10, Mar. 1985.
[14] P. A. Franaszek, J. T. Robinson, and A. Thomasian, "Access invariance and its use in high contention environments," IBM Res. Rep. RC 14704, July 1989.
[15] B. I. Galler, "Concurrency control performance issues," Ph.D. thesis, Comput. Sci. Dept., Univ. Toronto, Sept. 1982.
[16] B. I. Galler and L. Bos, "A model of transaction blocking in databases,"Perform. Evaluation, vol. 3, pp. 95-122.
[17] J. Gray, P. Homan, R. Obermarck, and H. Korth, "A straw man analysis of probability of waiting and deadlock," IBM, San Jose, CA, IBM Res. Rep. RJ 3066, 1981.
[18] K. B. Irani and H. L. Lin, "Queueing network models for concurrent transaction processing in a database system," inProc. ACM-SIGMOD Int. Conf. Management of Data, Boston, MA, Jan. 1979, pp. 134-142.
[19] S.S. Lavenberg,Computer Performance Modeling Handbook, Academic Press, New York, 1983.
[20] D.A. Menasce and T. Nakanishi, "Optimistic versus pessimistic concurrency control mechanism in database management systems,"Inform. Syst., vol. 7, no. 1, pp. 13-27, 1982.
[21] A. Reuter, "The transaction pipeline processor," inProc. Int. Workshop on High Performance Trans. Syst., Alisomar, 1985.
[22] D.J.T. Morris and W. S. Wang, "Performance analysis of locking and optimistic concurrency control algorithms,"Perform. Eval., vol. 5, pp. 105-118, 1985.
[23] D. Potier and P. Leblanc, "Analysis of locking policies in database management systems,"Commun. ACM, vol. 23, no. 10, pp. 584- 593, Oct. 1980.
[24] J. T. Robinson, "Experiments with transaction processing on multiprocessor," IBM, Yorktown Heights, NY, Res. Rep. RC9725, Dec. 1982.
[25] K. C. Sevick, "Comparison of concurrency control methods using analytic models," inInformation Processing '83, R.E.A. Mason, Ed. Amsterdam: North Holland, 1983, pp. 847-858.
[26] Y. C. Tay, "A mean value performance model for locking in databases," Ph.D. dissertation, Harvard Univ., Cambridge, MA, Feb. 1984.
[27] Y. C. Tay, R. Suri, and N. Goodman, "A mean value performance model for locking in databases: the no-waiting case,"J. ACM, vol. 32, no. 3, pp. 618-651, July 1985.
[28] 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.
[29] 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.
[30] P. S. Yu, D. M. Dias, J. T. Robinson, B. R. Iyer, and D. Cornell, "Modeling of centralized concurrency control in multi-system environment,"Perform. Eval. Rev., (Proc. 1985 ACM SIGMETRICS), vol. 13, no. 2, pp. 183-191.
[31] P.S. Yu, D. M. Dias, J. T. Robinson, B. R. Iyer, and D. W. Cornell, "On coupling multi-systems through data sharing,"Proc. IEEE, vol. 75, pp. 573-587, May 1987.
[32] P.S. Yu, D. M. Dias, D. W. Cornell, and B. R. Iyer, "Analysis of affinity based routing in multi-system data sharing,"Perform. Eval., vol. 7, no. 2, pp. 87-109, June 1987.
[33] P. S. Yu and D. M. Dias, "Impact of large memory on the performance of optimistic concurrency control schemes," inProc. PARABASE-90: Int. Conf. Databases, Parallel Architectures and their Applications, Miami Beach, FL, Mar. 1990, pp. 86-90.
[34] P.S. Yu, D.M. Dias, and S.S. Lavenberg, "On modeling database concurrency control," IBM, Yorktown Heights, NY, Res. Rep. RC 15386, Jan. 1990.

Index Terms:
hybrid concurrency control schemes; hybrid CC; CC scheme; rerun transactions; dynamic locking; dynamic hybrid OCC; optimistic concurrency control; broadcast OCC; high data contention environment; hybrid approach; analytic models; decomposition approach; mean-value-type analysis; concurrency control; database theory; optimisation; transaction processing
P.S. Yu, D.M. Dias, "Analysis of Hybrid Concurrency Control Schemes for a High Data Contention Environment," IEEE Transactions on Software Engineering, vol. 18, no. 2, pp. 118-129, Feb. 1992, doi:10.1109/32.121754
Usage of this product signifies your acceptance of the Terms of Use.