ACM Home Page
Please provide us with feedback. Feedback
The notions of consistency and predicate locks in a database system
Full text PdfPdf (1.06 MB)
Source
Communications of the ACM archive
Volume 19 ,  Issue 11  (November 1976) table of contents
Pages: 624 - 633  
Year of Publication: 1976
ISSN:0001-0782
Authors
K. P. Eswaran  IBM Research Lab, San Jose, CA
J. N. Gray  IBM Research Lab, San Jose, CA
R. A. Lorie  IBM Research Lab, San Jose, CA
I. L. Traiger  IBM Research Lab, San Jose, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 30,   Downloads (12 Months): 206,   Citation Count: 503
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/360363.360369
What is a DOI?

ABSTRACT

In database systems, users access shared data under the assumption that the data satisfies certain consistency constraints. This paper defines the concepts of transaction, consistency and schedule and shows that consistency requires that a transaction cannot request new locks after releasing a lock. Then it is argued that a transaction needs to lock a logical rather than a physical subset of the database. These subsets may be specified by predicates. An implementation of predicate locks which satisfies the consistency condition is suggested.


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
2
 
3
Chamberlin, D.D., Boyce, R.F., Traiger, I.L. A deadlockfree scheme for resource locking in a data-base environment, Information Processing 74, North-Holland Pub. Co., Amsterdam, 1974, pp.340-343.
4
 
5
Kleene, S.C. Introduction to Metamathematics. Van Nostrand, Princeton, N.J., 1952, p. 204.
 
6
IBM Information Management System for Virtual Storage (IMS/VS), Conversion and Planning Guide. Form No. SH20- 9034, IBM, Armonk, N.Y., 1973, pp. 38-44.
 
7
CODASYL, Data Base Task Group Report. ACM, N.Y., 1971.
 
8
Eswaran, K.P., Gray, J.N., Lorie, R.A., and Traiger, I.L. On the notions of consistency and predicate locks in a data base system. Res. Rep., RJ 1487, IBM Res. Lab., San Jose, Calif., 1974.

CITED BY  504

Collaborative Colleagues:
K. P. Eswaran: colleagues
J. N. Gray: colleagues
R. A. Lorie: colleagues
I. L. Traiger: colleagues