|
 ABSTRACT
The traditional approach to concurrency control is based on locking. Recently, new methods have been presented called optimistic methods. These methods are well suited in situations where the likelihood of conflicting actions is rather small. Otherwise locking should be used. Typically in database systems it is not known in advance what kind of transactions are to be processed. Therefore what is really needed are methods which combine the benefits of optimistic methods and locking. This paper is a first step in this direction.
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
|
M.A.Casanova, P.A.Bernstein 'General Purpose Schedulers for Database Systems' Acta Informatica 14, 1980
|
 |
2
|
|
| |
3
|
|
| |
4
|
|
| |
5
|
C.H.Papadimitriou, P.A.Bernstein, J.B.Rothnie 'Computational Problems Related to Database Concurrency Control' Conf. Theoretical Computer Science, Univ. Waterloo, 1977
|
| |
6
|
|
| |
7
|
|
| |
8
|
G.Schlageter 'Optimistic Methods for Concurrency Control in Distributed Database Systems' Int. Conf. on Very Large Databases, 1981
|
| |
9
|
R.E.Stearns, P.M.Lewis, D.J.Rosenkrantz 'Concurrency Control for Database Systems' Proc.17th IEEE Symp. on Found. of Comp. Sci. 1976
|
CITED BY 10
|
|
J. Karszt , G. Lausen , W. Stucky, Datenbank-Pascal an extendable database management system for personal computer networks, Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers, p.253-265, December 07-09, 1983, San Diego, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
H.2