Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics
Journal of the ACM (JACM)
A mean value performance model for locking in databases: the no-waiting case
Journal of the ACM (JACM)
Models for studying concurrency control performance: alternatives and implications
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
Effects of locking granularity in a database management system
ACM Transactions on Database Systems (TODS)
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
Performance Evaluation of Three Locking Protocols
Performance '87 Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
A concurrency control algorithm for nearest neighbor query
Information Sciences: an International Journal
| Hi-index | 0.00 |
The average lock range (ALR) is proposed as an evaluation factor for measuring the strengths and weaknesses of locking-based concurrency control methods, for both structural and nonstructural locking. The methodology provides a simple and general way to analyze the performance of any locking method, and requires no queueing model. Based on the concept of the ALR, two popular locking protocols, the 2PL protocol and the tree protocol, are analyzed and a simulation is done to validate the correctness of the ALR model.