On optimistic methods for concurrency control
H. T. Kung, John T. Robinson · ACM Transactions on Database Systems · 1981
Most current approaches to concurrency control in database systems rely on locking of data objects as a control mechanism. In this paper, two families of nonlocking concurrency controls are presented. The methods used are “optimistic” in the sense that they rely mainly on transaction backup as a control mechanism, “hoping” that conflicts between transactions will not occur. Applications for which these methods should be more efficient than locking are discussed.
Cited by 1,439 works. doi:10.1145/319566.319567 Open-access PDF
Authors
References
- The notions of consistency and predicate locks in a database system
- Notes on data base operating systems
- Organization and maintenance of large ordered indexes
- The serializability of concurrent database updates
- Concurrency of operations on B-trees
- On random 2?3 trees
- Efficient locking for concurrent operations on B-trees
- Concurrency control for database systems
- Concurrent search and insertion in 2?3 trees
- B-trees in a system with multiple users