ACM Home Page
Please provide us with feedback. Feedback
On optimistic methods for concurrency control
Full text PdfPdf (1.01 MB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 6 ,  Issue 2  (June 1981) table of contents
Pages: 213 - 226  
Year of Publication: 1981
ISSN:0362-5915
Authors
H. T. Kung  Carnegie-Mellon Univ., Pittsburgh, PA
John T. Robinson  Carnegie-Mellon Univ., Pittsburgh, PA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 45,   Downloads (12 Months): 287,   Citation Count: 245
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/319566.319567
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
BAYER, R., AND MCCREIGHT, E. Organization and maintenance of large ordered indexes. Acta Inf. 1, 3 (1972), 173-189.
 
2
BAYER, R., AND SCHKOLNICK, M. Concurrency of operations on B-trees. Acta Inf. 9, 1 (1977), 1-21.
 
3
ELLIS, C.S. Concurrency search and insertion in 2-3 trees. Acta Inf. 14, 1 (1980), 63-86.
4
 
5
6
7
 
8
LAMPORT, L. Towards a theory of correctness for multi-user data base systems. Tech. Rep. CA- 7610-0712, Massachusetts Computer Associates, Inc., Wakefield, Mass., Oct. 1976.
 
9
LEHMAN, P. L., AND YAO, S.B. Efficient locking for concurrent operations on B-trees. Submitted for publication.
 
10
MILLER, R. E., AND SNYDER, L. Multiple access to B-trees. Presented at Proc. Conf. Information Sciences and Systems, Johns Hopkins Univ., Baltimore, Md., Max. 1978.
 
11
PAPADIMITRIOU, C. H., BERNSTEIN, P. A., AND ROTHNIE, J.B. Computational problems related to database concurrency control. In Conf Theoretical Computer Science, Univ. Waterloo, 1977, pp. 275-282.
12
 
13
SAMADI, B. B-trees in a system with multiple users. Inf. Process. Lett. 5, 4 (Oct. 1976), I07-112.
 
14
STEARNS, R. E., LEWIS, P. M., II, AND ROSENKRANTZ, D.J. Concurrency control for database systems. In Proc. 7th Syrup. Foundations of Computer Science, I976, pp. I9-32.
 
15
YAo, A. On random 2-3 trees. Acta Inf. 2, 9 (1978), 159-170.

CITED BY  245

Collaborative Colleagues:
H. T. Kung: colleagues
John T. Robinson: colleagues