On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
Process synchronization in database systems
ACM Transactions on Database Systems (TODS)
The serializability of concurrent database updates
Journal of the ACM (JACM)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Optimistic concurrency control for abstract data types
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Optimistic concurrency control for abstract data types
ACM SIGOPS Operating Systems Review
Single-Site and Distributed Optimistic Protocols for Concurrency Control
IEEE Transactions on Software Engineering
Apologizing versus asking permission: optimistic concurrency control for abstract data types
ACM Transactions on Database Systems (TODS)
Adaptable concurrency control for atomic data types
ACM Transactions on Computer Systems (TOCS)
A Model for Adaptable Systems for Transaction Processing
IEEE Transactions on Knowledge and Data Engineering
Distributed Optimistic Concurrency Control Methods for High-Performance Transaction Processing
IEEE Transactions on Knowledge and Data Engineering
Certification by Intervals of Timestamps in Distributed Database Systems
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Mixed concurrency control: Dealing with heterogeneity in distributed database systems
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Datenbank-Pascal an extendable database management system for personal computer networks
SIGSMALL '83 Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers
| Hi-index | 0.00 |
The traditional approach to concurrency control is based on locking. Recently, new methods have been presented called optimistic methods. These methods are well suited in situations where the likelihood of conflicting actions is rather small. Otherwise locking should be used. Typically in database systems it is not known in advance what kind of transactions are to be processed. Therefore what is really needed are methods which combine the benefits of optimistic methods and locking. This paper is a first step in this direction.