Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics
Journal of the ACM (JACM)
Analysis of locking policies in database management systems
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
Queueing network models for concurrent transaction processing in a database system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
A simple analytic model for performance of exclusive locking in database systems
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Timestamp-based algorithms for concurrency control in distributed database systems
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
| Hi-index | 0.98 |
The performance of transaction processing systems is affected by contention for hardware as well as software resources (data objects). Software contention becomes prominent in database systems because concurrency control mechanism, which is used to insure integrity of the database, restrict concurrent and conflicting access to data objects of a database. Locking is the most popular scheme to achieve concurrency control in database systems. Performance of a database system is greatly determined by its underlying concurrency control algorithm because it determines the performance degradation in presence of software contentions. In this paper, we will examine the issues in the performance analysis of concurrency control algorithms and their affect on the overall database system performance. With many alternatives now available to design a database system, there is a tremendous need to assess the suitability of a design to a particular environment and need. In this paper, we will discuss difficulties in modeling concurrency control algorithms and describe how these difficulties have been overcome.