Concurrency control: Methods, performance, and analysis

ACM Computing Surveys

Volumn 30, Issue 1, 1998, Pages 70-119

  Thomasian, Alexander ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Adaptive methods; Algorithms; Concurrency control; D.4.8 operating systems : Performance Modeling and prediction; stochastic analysis; simulation; Data contention; Deadlocks; H.2.4 database management systems Transaction processing; Performance

Indexed keywords

BLOCKING; PERFORMANCE DEGRADATION;

COMPUTER HARDWARE; COMPUTER SYSTEM RECOVERY; DATA PROCESSING; DATABASE SYSTEMS; INPUT OUTPUT PROGRAMS; PROBABILITY; ADAPTIVE CONTROL SYSTEMS; ALGORITHMS; COMPUTER SIMULATION; MARKOV PROCESSES; OPTIMIZATION; QUEUEING THEORY;

CONCURRENCY CONTROL;

RESTART-ORIENTED LOCKING METHODS; STANDARD LOCKING; TWO-PHASE LOCKING;

EID: 0032010381     PISSN: 03600300     EISSN: None     Source Type: Journal    
DOI: 10.1145/274440.274443     Document Type: Article

References (115)

1. AGRAWAL, D., EL ABBADI, A., AND LANG, A. E. 1994. The performance of protocols based on locks with ordered sharing. IEEE Trans. Knowl. Data Eng. 6, 5 (Oct.), 805-818.
2. AGRAWAL, R., CAREY, M. J., AND LIVNY, M. 1987a. Concurrency control performance modeling: Alternatives and implications. ACM Trans. Database Syst. 12, 4 (Dec.), 609-654.
3. AGRAWAL, R., CAREY, M. J. AND MCVOY, L. W. 1987b. The performance of alternative strategies for dealing with deadlocks in database management systems. IEEE Trans. Softw. Eng. 13, 12 (Dec.), 1348-1363.
4. AMMANN, P., JAJODIA, S., AND RAY, I. 1997. Applying formal methods to semantic-based decomposition of transactions. ACM Trans. Database Syst. 22, 2 (June), 215-254.
5. BADRINATH, B. R. AND RAMAMITHRAM, K. 1992. Semantics-based concurrency control: Beyond commutativity. ACM Trans. Database Syst. 17, 1 (March), 163-199.
6. BARGHOUTI, N. S. AND KAISER, G. E. 1991. Concurrency control in advanced database applications. ACM Comput. Surv. 23, 3 (Sept.), 269-317.
7. BAYER, R. 1986. Consistency of transactions and random batch. ACM Trans. Database Syst. 11, 4 (Dec.), 397-404.
8. BERNSTEIN, P. A. AND GOODMAN, N. 1981. Concurrency control in distributed database systems. ACM Comput. Surv. 13, 2 (June), 185-221.
9. BERNSTEIN, P., HADZILACOS, V., AND GOODMAN, N. 1987. Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading, MA.
10. BESTAVROS, A. AND BRAOUDAKIS, S. 1995. Value-cognizant speculative concurrency control. Proceedings of the 21st International Conference on Very Large Data Bases (Zurich, Switzerland, Sept.) 122-133.
11. BOBER, P. M. AND CAREY, M. J. 1992. On mixing queries and transactions via multiversion locking. Proceedings of the Eighth International Conference on Data Engineering (Tempe, AZ, Feb.), 535-545.
12. BOKSENBAUM, C., CART, M., FERRIE, J., AND PONS, J. F. 1987. Concurrent certification by interval of timestamps in distributed database systems. IEEE Trans. Softw. Eng. 13, 4 (April), 409-419.
13. BREITBART, Y., GARCIA-MOLINA, H., AND SILBERSCHATZ, A. 1992. Overview of multidatabase transaction management. Int. J. Very Large Data Bases 1, 181-239.
14. BURGER, A. AND THANISCH, P. 1994. Branching transactions: A transaction model for parallel database systems. In Directions in Databases: Proceedings of the Twelfth British National Conference on Databases, BNCOD 12 (Guildford, UK, July), D. S. Bowers, Ed., 121-136.
15. CAREY, M. J. AND LIVNY, M. 1991. Conflict detection tradeoffs for replicated data. ACM Trans. Database Syst. 16, 4 (Dec.), 703-746.
16. CAREY, M. J., JAUHARI, R., AND LIVNY, M. 1991. On transaction boundaries in active databases: A performance perspective. IEEE Trans. Knowl. Data Eng. 3, 3 (Sept.), 320-336.
17. CAREY, M. J., FRANKLIN, M. J., LIVNY, M., AND SHEKITA, E. J. 1991. Data caching tradeoffs in client server DBMS architectures. In Proceedings of the 1991 ACM SIGMOD International Conference on Management of Data (Denver, CO, May) 357-366.
18. CELLARY, W., GELENBE, E., AND MORZY, T. 1988. Concurrency Control in Distributed Databases. North-Holland.
19. CERI, S. AND PELAGATTI, G. 1984. Distributed Databases - Principles and Systems. McGraw-Hill, New York.
20. CHESNAIS, A., GELENBE, E., AND MITRANI, I. 1983. On the modeling of parallel access to shared data. Commun. ACM 26, 3 (March), 198-202.
21. DATE, C. J. 1983. An Introduction to Database Systems, Vol. II. Addison-Wesley, Reading, MA.
22. ELMAGARMID, A. K. 1992. Database Transaction Models for Advanced Applications. Morgan-Kaufmann, San Mateo, CA.
23. FARRAG, A. A. AND OZSU, M. T. 1989. Using semantic knowledge of transactions to increase concurrency. ACM Trans. Database Syst. 14, 4 (Dec.), 503-525.
24. FRANASZEK, P. AND ROBINSON, J. T. 1985. Limitations of concurrency in transaction processing. ACM Trans. Database Syst. 10, 1 (March), 1-28.
25. FRANASZEK, P. A., HARITSA, J. R., ROBINSON, J. T., AND THOMASIAN, A. 1993. Distributed concurrency control based on limited wait depth. IEEE Trans. Parallel Distrib. Syst. 4, 11 (Nov.), 1246-1264.
26. FRANASZEK, P., ROBINSON, J. T., AND THOMASIAN, A. 1990. Access invariance and its use in high contention environments. In Proceedings of the Sixth International Conference on Data Engineering (Los Angeles, Feb.), 47-55.
27. FRANASZEK, P. A., ROBINSON, J. T., AND THOMASIAN, A. 1991a. Adaptive concurrency control scheme for transaction processing. IBM Tech. Disclosure Bull. 33, 9 (Feb.), 29-30.
28. FRANASZEK, P. A., ROBINSON, J. T., AND THOMASIAN, A. 1991b. Integrated concurrency control/ CPU scheduling. IBM Tech. Disclosure Bull. 33, 9 (Feb.), 37-40.
29. FRANASZEK, P., ROBINSON, J. T., AND THOMASIAN, A. 1992. Concurrency control for high contention environments. ACM Trans. Database Syst. 17, 2 (June), 304-345.
30. GALLER, B. I. AND BOS, L. 1983. A model of transaction blocking in databases. Perform. Eval. 3, 95-122.
31. GARCIA-MOLINA, H. 1983. Using semantic knowledge for transaction processing in a distributed database. ACM Trans. Database Syst. 8, 2 (June), 186-213.
32. GARCIA-MOLINA, H. AND SALEM, K. 1987. Sagas. In Proceedings of the 1987 SIGMOD Conference on Management of Data (San Francisco, May), 249-259.
33. GRAY, J. N., Ed. 1993. The Benchmark Handbook for Transaction Processing Systems, 2nd ed. Morgen-Kaufmann, San Mateo, CA.
34. GRAY, J. N. AND REUTER, A. 1992. Transaction Processing: Concepts and Facilities. Morgan-Kaufmann, San Mateo, CA.
35. HAERDER, T. 1984. Observations on optimistic concurrency control schemes. Inf. Syst. 9, 2, 111-120.
36. HAERDER, T. AND ROTHERMEL, K. 1993. Concurrency control issues in nested transactions. Int. J. Very Large Data Bases 2, 39-74.
37. HSU, M. AND ZHANG, B. 1992. Performance evaluation of cautious waiting. ACM Trans. Database Syst. 17, 3 (Sept.), 477-512.
38. HSU, M. AND ZHANG, B. 1995. Modeling performance impact of hot spots. In Performance of Concurrency Control Mechanisms in Centralized Database Systems, V. Kumar, Ed. Prentice-Hall, Englewood Cliffs, NJ, Chapter 7, 148-164.
39. HUANG, J., STANKOVIC, J. A., RAMAMITHRAM, K., AND TOWSLEY, D. 1991. Experimental evaluation of real-time optimistic concurrency control schemes. In Proceedings of the Seventeenth International Conference on Very Large Data Bases (Barcelona, Sept.), 35-46.
40. IRANI, K. B. AND LIN, H. L. 1979. Queueing network models for concurrent transaction processing in database systems. In Proceedings of the 1979 ACM SIGMOD International Conference on Management of Data (Boston, June), 134-142.
41. JAGADISH, H. V. AND SHMUELLI, O. 1992. A proclamation based model for cooperating transactions. In Proceedings of the Eighteenth International Conference on Very Large Data Bases (Vancouver, Canada, August), 265-276.
42. JENQ, B. C., TWICHELL, B. C., AND KELLER, T. W. 1989. Locking performance in a shared nothing parallel database machine. IEEE Trans. Knowl. Data Eng. 1, 4 (Dec.), 530-543.
43. JOHNSON, T. AND SHASHA, D. 1993. The performance of concurrent B-tree algorithms. ACM Trans. Database Syst. 18, 1 (March), 51-101.
44. KHOSHAFIAN, S. AND BUCKIEWICZ, M. 1995. Introduction to Groupware, Workflow, and Workgroup Computing. John Wiley, New York.
45. KLEINROCK, L. 1975. Queueing Systems, Vol. I: Theory. John Wiley, New York.
46. KORTH, H. F. AND SPEEGLE, G. 1994. Formal aspects of concurrency control in long duration transaction systems using the NT/PV model. ACM Trans. Database Syst. 19, 3 (Sept.), 492-535.
47. KRISHNAKUMAR, N. AND BERNSTEIN, A. J. 1994. Bounded ignorance: A technique for increasing concurrency in a replicated system. ACM Trans. Database Syst. 19, 4 (Dec.), 586-625.
48. KUMAR, V., Ed. 1995. Performance of Concurrency Control Mechanisms in Centralized Database Systems. Prentice-Hall, Upper Saddle River, NJ.
49. KUNG, H. T. AND ROBINSON, J. T. 1981. On optimistic concurrency control methods. ACM Trans. Database Syst. 6, 2 (June), 213-226.
50. LANGER, A. M. AND SHUM, A. W. 1982. The distribution of granule accesses made by database transactions. Commun. ACM 25, 11 (Nov.), 831-832.
51. LAZOWSKA, E. D., ZAHORJAN, J., GRAHAM, G. S., AND SEVCIK, K. C. 1984. Quantitative System Performance: Computer System Analysis Using Queueing Network Models. Prentice-Hall, Upper Saddle River, NJ.
52. LI, K. AND NAUGHTON, J. F. 1988. Multiprocessor main memory transaction processing. In Proceedings of the International Symposium on Databases in Parallel and Distributed Systems (Austin, TX, Dec.), 177-187.
53. LYNCH, N., MERRITT, M., WEIHL, W., AND FEKETE, A. 1994. Atomic Transactions. Morgan-Kaufmann, San Mateo, CA.
54. MASSEY, W. 1986. A probabilistic analysis of database systems. In Proceedings of Performance 86 and ACM SIGMETRICS 1986 Joint Conference (Raleigh, NC, May), 141-146.
55. MEHROTRA, S., KORTH, H. F., AND SILBERSCHATZ, A. 1997. Concurrency control in hierarchical multidatabase systems. Int. J. Very Large Data Bases 6, 157-172.
56. MENASCE, D. A. AND NAKANISHI, T. 1982. Optimistic versus pessimistic concurrency control mechanisms in database management systems. Inf. Syst. 7, 1, 13-27.
57. MOENKEBERG, A. AND WEIKUM, G. 1992. Performance evaluation of an adaptive and robust load control method for the avoidance of data contention thrashing. In Proceedings of the Eighteenth International Conference on Very Large Data Bases (Vancouver, Canada, Aug.), 432-443.
58. MOHAN, C. 1992. Less optimism about optimistic concurrency control. In Proceedings of the Second International Workshop on Research Issues on Data Engineering (Tempe, AZ, Feb.), 199-204.
59. MOHAN, C. AND LEVINE, F. 1992. ARIES/IM: An efficient and high concurrency index management method using write-ahead logging. In Proceedings of the 1992 ACM SIGMOD International Conference on Management of Data (San Diego, June), 371-380.
60. MOHAN, C., HADERLE, D., LINDSAY, B., PIRAHESH, H., AND SCHWARTZ, P. 1992a. ARIES: A transaction recovery method supporting fine granularity locking and partial rollbacks using write-ahead locking. ACM Trans. Database Syst. 17, 1 (March), 94-162.
61. MOHAN, C., PIRAHESH, H., AND LORIE, R. 1992b. Efficient and flexible methods for transient versioning of records to avoid locking by read-only transactions. In Proceedings of the 1992 ACM SIGMOD International Conference on Management of Data (San Diego, June), 124-133.
62. MONTGOMERY, W. A. 1978. Robust concurrency control for a distributed information system. MIT-LCS-TR-207, MIT, Lab. for Computer Science, Cambridge, MA. (Dec.).
63. MORRIS, R. J. T. AND WONG, W. S. 1985. Performance analysis of locking and optimistic concurrency control algorithms. Perform. Eval. 5, 2, 105-118.
64. MOSS, J. E. B. 1985. Nested Transactions: An Approach to Reliable Distributed Computing. MIT Press, Cambridge, MA.
65. O'NEIL, P. E. 1986. The escrow transaction method. ACM Trans. Database Syst. 11, 4 (Dec.), 405-430.
66. O'NEIL, P. E., RAMAMITHRAM, K., AND PU, C. 1995. A two-phase approach to predictability scheduling real-time transactions. In Performance of Concurrency Control Methods in Centralized Database Systems V. Kumar, Ed., Prentice-Hall, Englewood Cliffs, NJ, 494-522.
67. OZSU, M. T. 1994. Transaction models and transaction management in object-oriented database management systems. In Advances in Object-Oriented Database Systems. A. Dogac, M. T. Ozsu, A. Biliris, and T. Sellis, Eds. Springer-Verlag, New York, 147-184.
68. PEINL, P., REUTER, A., AND SAMMER, H. 1988. High contention in a stock trading database: A case study. In Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data (Chicago, June), 260-268.
69. POTIER, D. AND LEBLANC, P. 1980. Analysis of locking policies in database management systems. Commun. ACM 23, 10 (Oct.), 584-593.
70. PU, C. AND LEFF, A. 1991. Replica control in distributed databases: An asynchronous approach. In Proceedings of the 1991 ACM SIGMOD International Conference on Management of Data (Denver, CO, May), 377-386.
71. RAHM, E. 1993. Empirical performance evaluation of concurrency and coherency control protocols for database sharing systems. ACM Trans. Database Syst. 18, 2 (June), 333-377.
72. RAMAMITHRAM, K. 1993. Real-time databases. Distrib. Parallel Databases 1, 199-226.
73. RAMAMITHRAM, K. AND CHRISANTHIS, P. K. 1996. Advances in Concurrency Control and Transaction Processing. IEEE Computer Society Press, Los Alamitos, CA.
74. REUTER, A. 1985. The transaction pipeline processor. In International Workshop on High Performance Transaction Systems (Pacific Grove, CA, Sept.).
75. ROBINSON, J. T. 1982a. Design of concurrency controls for transaction processing systems. Tech. Rep. CMU-CS-82-114, Ph.D. Thesis, Computer Science Dept., Carnegie-Mellon University, Pittsburgh, PA.
76. ROBINSON, J. T. 1982b. Experiments with transaction processing on a multiprocessor. IBM Res. Rep. RC 9725, Yorktown Heights, NY, Dec.
77. ROBINSON, J. T. 1984. Separating policy from correctness in concurrency control design. Softw. Pract. Exper. 14, 9 (Sept.), 827-844.
78. ROSENKRANTZ, D. J., STEARNS, R. E., AND LEWIS, P. M., II. 1978. System level concurrency control for distributed database systems. ACM Trans. Database Syst. 3, 2 (June), 178-198.
79. RYU, I. K. AND THOMASIAN, A. 1987. Performance evaluation of centralized databases with optimistic concurrency control. Perform. Eval. 7, 3, 195-211.
80. RYU, I. K. AND THOMASIAN, A. 1988. Performance analysis of centralized databases with static locking. Unpublished rep., IBM T. J. Watson Research Center, Hawthorne, NY.
81. RYU, I. K. AND THOMASIAN, A. 1990a. Analysis of database performance with dynamic locking. J. ACM 37, 3 (July), 491-523.
82. RYU, I. K. AND THOMASIAN, A. 1990b. Performance analysis of dynamic locking with the no-waiting policy. IEEE Trans. Softw. Eng. 16, 7 (July), 684-698.
83. SALEM, K., GARCIA-MOLINA, H., AND SHANDS, J. 1994. Altruistic locking. ACM Trans. Database Syst. 19, 1 (March), 117-165.
84. SAMARAS, G., BRITTON, K., CITRON, A., AND MOHAN, C. 1995. Two-phase commit optimizations in a commercial distributed environment. Distrib. Parallel Databases, 325-360.
85. SHASHA, D., LLIRBAT, F., SIMON, E., AND VALDURIEZ, P. 1995. Transaction chopping: Algorithms and performance studies. ACM Trans. Database Syst. 20, 3 (Sept.), 325-363.
86. SINGHAL, M. 1991. Performance analysis of the basic timestamp ordering algorithm via Markov modeling. Perform. Eval. 12, 17-41.
87. SINGHAL, V. AND SMITH, A. J. 1997. Analysis of locking behavior in three real database systems. Int. J. Very Large Data Bases 6, 40-52.
88. SKAHRA, A. H. AND ZDONIK, S. B. 1989. Concurrency control and object-oriented databases. In Object-Oriented Concepts, Databases, and Applications. W. Kim and F. H. Lochovski, Eds., ACM Press, New York, 395-421.
89. SRINIVASAN, V. AND CAREY, M. J. 1993. Performance of B+ tree concurrency control algorithms. Int. J. Very Large Data Bases 2, 361-406.
90. TAY, Y. C. 1987. Locking Performance in Centralized Databases. Academic Press, Orlando, FL.
91. TAY, Y. C. 1990. Issues in modeling locking performance. In Stochastic Analysis of Computer T. and Communication Systems, H. Takagi, Ed., North-Holland, New York, 631-658.
92. TAY, Y. C., GOODMAN, N., AND SURI, R. 1985a. Locking performance in centralized databases. ACM Trans. Database Syst. 10, 4 (Dec.), 415-462.
93. TAY, Y. C., SURI, R., AND GOODMAN, N. 1985b. A mean value performance model for locking in databases: The no-waiting case. J. ACM 32, 3 (July), 618-651.
94. THOMASIAN, A. 1982. An iterative solution to the queueing network model of a DBMS with dynamic locking. In Proceedings of the Thirteenth Computer Measurement Group Conference (San Diego, Dec.), 252-261.
95. THOMASIAN, A. 1985. Performance evaluation of centralized databases with static locking. IEEE Trans. Softw. Eng. 11, 2 (April), 346-355.
96. THOMASIAN, A. 1988. Distributed optimistic concurrency control methods for high-performance transaction processing. IEEE Trans. Knowl. Eng. 10, 1 (Jan./Feb.), 2-18.
97. THOMASIAN, A. 1992. Performance analysis of locking policies with limited wait depth. In Proceedings of Performance 92 and ACM SIGMETRICS Joint Conference (Newport, RI, June), 115-127.
98. THOMASIAN, A. 1993. Two-phase locking and its thrashing behavior. ACM Trans. Database Syst. 18, 4 (Dec.), 579-625.
99. THOMASIAN, A. 1994. A fractional data allocation method for distributed databases. In Proceedings of the Third International Conference on Parallel and Distributed Information Systems (Austin, TX, Sept.), 168-175.
100. THOMASIAN, A. 1995a. Performance analysis of locking policies with limited wait depth. Perform. Eval. (submitted). Also IBM Res. Rep. RC 19977, Hawthorne, NY, March.
101. THOMASIAN, A. 1995b. Checkpointing for optimistic concurrency control methods. IEEE Trans. Knowl. Data Eng. 7, 2 (April), 332-339.
102. THOMASIAN, A. 1996a. Database Concurrency Control: Methods, Performance, Analyses. Kluwer Academic, Boston.
103. THOMASIAN, A. 1996b. On realistic modeling and analysis of lock contention. Inf. Syst. 21, 5, 409-430.
104. THOMASIAN, A. 1997. A performance comparison of locking policies with limited wait depth. IEEE Trans. Knowl. Data Eng. 8, 2 (May/June), 421-434.
105. THOMASIAN, A. 1998. Distributed optimistic concurrency control methods for high performance transaction processing. IEEE Trans. Knowl. Data Eng. 10, 1 (Jan/Feb.), 2-18.
106. THOMASIAN, A. AND NICOLA, V. 1993. Performance evaluation of a threshold policy for scheduling readers and writers. IEEE Trans. Computers 42, 1 (Jan.), 83-98.
107. THOMASIAN, A. AND RAHM, E. 1990. A new distributed optimistic concurrency control method and a comparison of its performance with two-phase locking. In Proceedings of 1990 International Conference on Distributed Computing Systems (Paris, May), 294-301.
108. THOMASIAN, A. AND RYU, I. K. 1983. A decomposition solution to the queueing network model of the centralized DBMS with static locking. In Proceedings of the ACM SIGMETRICS Conference (Minneapolis, MN, Aug.), 82-92.
109. THOMASIAN, A. AND RYU, I. K. 1986. Performance comparison of concurrency control methods for shared centralized databases. Unpublished rep., IBM T. J. Watson Research Center, Hawthorne, NY.
110. THOMASIAN, A. AND RYU, I. K. 1989. A recursive solution method to analyze the performance of static locking systems. IEEE Trans. Softw. Eng. 15, 10 (Oct.), 1147-1156.
111. THOMASIAN, A. AND RYU, I. K. 1991. Performance analysis of two-phase locking. IEEE Trans. Softw. Eng. 17, 5 (May), 386-402.
112. WEIHL, W. E. 1988. Commutativity based CC for abstract data types. IEEE Trans. Computers 37, 12 (Dec.), 1488-1505.
113. WEIKUM, G. 1991. Principles and realization strategies of multilevel transaction management. ACM Trans. Database Syst. 16, 4 (March), 132-180.
114. WEIKUM, G., HASSE, C., MOENKEBERG, A., AND ZABBACK, P. 1994. The COMFORT automatic tuning project. Inf. Syst. 19, 5, 381-432.
115. YU, P. S., DIAS, D. M., AND LAVENBERG, S. S. 1993. On modeling database concurrency control. J. ACM 40, 4 (Sept.), 831-872.