KRISHNA — Concurrency Control Algorithms based on Dynamic Attributes
Three new concurrency control mechanisms that utilizes the dynamic attribute of concurrent transactions for resolving conflicts are presented. Our study shows that their performance is superior to all well-known two-phase concurrency control mechanisms. There are a large number of such algorithms but we report our findings since our approach has some unique features worth exploring.
KeywordsConflict Resolution Absolute Priority Transaction Size Conflict Rate Concurrent Transaction
Unable to display preview. Download preview PDF.
- R. Agrawal, at. al., “The Performance of Alternative Strategies for dealing with Deadlocks in Database Management Systems”, IEEE Trans on SE„ Vol. SE-13, No. 12, Dec. 1987.Google Scholar
- K.P. Eswaran, at. al., “The Notions of Consistency and Predicate Locks in database Systems”, Comm. ACM Vol. 19, No. 11, Nov. 1976.Google Scholar
- M. Hsu and B. Zhang, “The Mean Value Approach to Performance Evaluation of Cautious Waiting”, Submitted for Publication, 1987.Google Scholar
- V.Kumar, “Performance Comparison of Database Concurrency Control Mechanisms based on Two-Phase Locking, Timestamping and Mixed Approach”, Information Sciences: An International Journal, Vol. 51, No. 3, 1990.Google Scholar
- V. Kumar and Meichun Hsu, “A Superior Two-Phase Locking Algorithm and Its Performance”, Information Sciences: An International Journal,(Accepted for publication).Google Scholar
- Shemer, J.E. and Collmeyer, A.J., “Database sharing-A study of interference, roadblocks, and deadlocks”, Proc. 1972 ACM SIGFIDET Workshop, pp. 147–163.Google Scholar
- Y.C. Tay at. al., “Locking performance in centralized databases,” ACM TODS, 10 (4), pp. 415–462, Dec. 85.Google Scholar