DMCA
On optimistic methods for concurrency control (1981)
Cached
Download Links
- [www.seas.upenn.edu]
- [www.cs.wisc.edu]
- [pages.cs.wisc.edu]
- [www.eecs.harvard.edu]
- [ss.hnu.cn]
- [ece.ut.ac.ir]
- [www.cs.ucdavis.edu]
- [www.seas.upenn.edu]
- [ece.ut.ac.ir]
- [www.cs.cmu.edu]
- [www.cs.cmu.edu]
- [www.cs.cmu.edu]
- [www.cs.cmu.edu]
- [www.cs.cmu.edu]
- [www.cs.cmu.edu]
- [www.cs.cmu.edu]
- [www.cs.cmu.edu]
- [www.cs.berkeley.edu]
- [www.cs.purdue.edu]
- [www.cs.purdue.edu]
- [people.csail.mit.edu]
- [www.eecs.berkeley.edu]
- [www.collide.info]
- [www.cs.berkeley.edu]
- DBLP
Other Repositories/Bibliography
by
H. T. Kung
,
John T. Robinson
| Venue: | ACM Transactions on Database Systems |
| Citations: | 539 - 1 self |
BibTeX
@ARTICLE{Kung81onoptimistic,
author = {H. T. Kung and John T. Robinson},
title = {On optimistic methods for concurrency control},
journal = {ACM Transactions on Database Systems},
year = {1981},
volume = {6},
pages = {213--226}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
