ACM Home Page
Please provide us with feedback. Feedback
Locks with constrained sharing (extended abstract)
Full text PdfPdf (863 KB)
Source Symposium on Principles of Database Systems archive
Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents
Nashville, Tennessee, United States
Pages: 85 - 93  
Year of Publication: 1990
ISBN:0-89791-352-3
Authors
Divyakant Agrawal  Department of Computer Science University of California Santa Barbara, CA
Amr El Abbadi  Department of Computer Science, University of California, Santa Barbara, CA
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 15,   Citation Count: 17
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

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/298514.298545
What is a DOI?

ABSTRACT

In this paper, we propose a new mode for locks that permits sharing in a constrained manner. We develop a family of locking protocols, the strictest of which is the two phase locking protocol while the most permissive recognizes all conflict-preserving serializable histories. This is the first locking-based protocol that can recognize the entire class of conflict-preserving serializable histories.


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
D. Z. Badal. Correctness of Concurrency Control and Implications in Distributed Databases. In IEEE Proceedings of COMPSAC Conference, pages 588-593, November 1979.
 
2
 
3
P. A. Bernstein, D. W. Shipman, and W. S. Wong. Formal aspects of serializability in database concurrency control. IEEE Transactions on Software Engineering, 5(5):203-216, May 1979.
 
4
5
6
7
8
9
 
10
11
 
12
M. Yannakakis, C. H. Papadimitriou, and H. T. Kung. Locking Protocols: Safety and Freedom from Deadlock. In Proceedings of the Twentieth 1EEE Symposium on Foundations of Computer Science, pages 286-297, 1979.

CITED BY  17
 
 
 
 
 
 
 

Collaborative Colleagues:
Divyakant Agrawal: colleagues
Amr El Abbadi: colleagues

Peer to Peer - Readers of this Article have also read: