Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Analysis of locking policies in database management systems
Communications of the ACM
Concurrency in database systems: a simulation study
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
The effects of concurrency control on the performance of database management systems.
The effects of concurrency control on the performance of database management systems.
Performance of update algorithms for replicated data in a distributed database.
Performance of update algorithms for replicated data in a distributed database.
Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics
Journal of the ACM (JACM)
Integrated concurrency control and recovery mechanisms: design and performance evaluation
ACM Transactions on Database Systems (TODS)
Concurrency control performance modeling: alternatives and implications
ACM Transactions on Database Systems (TODS)
The Delay Due to Dynamic Two-Phase Locking
IEEE Transactions on Software Engineering
Models for studying concurrency control performance: alternatives and implications
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
A mean value performance model for locking in databases: the waiting case
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
The Performance of Concurrency Control Algorithms for Database Management Systems
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
A simple analysis of exclusive and shared lock contention in a database system
SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Performance issues in database systems
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
Many different algorithms have been proposed for database concurrency control, and many more can be synthesized by combining locking and timestamping. The correctness of these algorithms is already well understood, their performance is not. We need a model to help us understand, compare and control the behavior of locking and timestamping we present here a model which we hope will eventually play such a role, but which we believe is simple to understand and use.