Granularity of locks in a shared data base

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Granularity of locks in a shared data base

Full text

Pdf (1.59 MB)

Source

Very Large Data Bases archive
Proceedings of the 1st International Conference on Very Large Data Bases table of contents

Framingham, Massachusetts

SESSION: Security and integrity table of contents

Pages: 428 - 451

Year of Publication: 1975

Authors

J. N. Gray	IBM Research Laboratory, San Jose, California
R. A. Lorie	IBM Research Laboratory, San Jose, California
G. R. Putzolu	IBM Research Laboratory, San Jose, California

Sponsors

SIGIR: ACM Special Interest Group on Information Retrieval
: ACM SIGBDP
SIGMOD: ACM Special Interest Group on Management of Data

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 23, Downloads (12 Months): 70, Citation Count: 4

Additional Information:

abstract references cited by collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1282480.1282513 What is a DOI?

ABSTRACT

This paper proposes a locking protocol which associates locks with sets of resources. This protocol allows simultaneous locking at various granularities by different transactions. It is based on the introduction of additional lock modes besides the conventional share mode and exclusive mode. The protocol is generalized from simple hierarchies of locks to directed acyclic graphs of locks and to dynamic graphs of locks. The issues of scheduling and granting conflicting requests for the same resource are then discussed. Lastly, these ideas are compared with the lock mechanisms provided by existing data management systems.

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	K. P. Eswaran, J. N. Gray, R. A. Lorie, I. L. Traiger, "On the notions of consistency and predicate locks," Technical Report RJ. 1487, IBM Research Laboratory, San Jose, Ca., Nov. 1974.
	2	"Information management system virtual storage (IMS/VS). System application design guide," form no. SH20-9025-2, IBM Corp., 1975.
	3	"UNIVAC 1100 series data management system (DMS 1100). ANSI COBOL field data manipulation language." Order No. UP7908--2, Sperry Rand Corp., May 1973.

CITED BY 4

	Sigmund Cherem , Trishul Chilimbi , Sumit Gulwani, Inferring locks for atomic sections, ACM SIGPLAN Notices, v.43 n.6, June 2008
	Bruce G. Lindsay, Jim Gray at IBM: the transaction processing revolution, ACM SIGMOD Record, v.37 n.2, June 2008
	Pascal Felber , Christof Fetzer , Torvald Riegel, Dynamic performance tuning of word-based software transactional memory, Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming, February 20-23, 2008, Salt Lake City, UT, USA
	Bogdan Czejdo , Marek Rusinkiewicz, REQUEST: a testbed relational database management system for instructional and research purposes, Proceedings of the July 9-12, 1984, national computer conference and exposition, July 09-12, 1984, Las Vegas, Nevada

Collaborative Colleagues:

J. N. Gray: colleagues

R. A. Lorie: colleagues

G. R. Putzolu: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player