ACM Home Page
Please provide us with feedback. Feedback
An approach to eliminate transaction blocking in locking protocols
Full text PdfPdf (891 KB)
Source Symposium on Principles of Database Systems archive
Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents
San Diego, California, United States
Pages: 223 - 235  
Year of Publication: 1992
ISBN:0-89791-519-4
Authors
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 13,   Citation Count: 4
Additional Information:

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

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
D. Agrawal and A. El Abbadi. Ordered Sharing: A New Lock Primitive for Database Systems. Technical Report TRCS 91-18, Department of Computer Science, University of California, Santa Barbara, CA 93106, 1991.
3
 
4
5
 
6
7
8
9
10
 
11
 
12
P.A. Bernstein, D. W. Shipman, and W. S. Wong. FormM aspects of serializability in database concurrency control. IEEE Transactions on Software Engineering, 5(5):203-216, May 1979.
 
13
14
15
16
17
18
19
 
20
 
21
22
 
23
C. Mohan. Private communication, 1991.
24
25
 
26
 
27
 
28
29
30
 
31
32
 
33
 
34
35


Collaborative Colleagues:
D. Agrawal: colleagues
A. El Abbadi: colleagues
R. Jeffers: colleagues