Empirical Comparison of Database Concurrency Schemes

[1]  Irving L. Traiger,et al.  Granularity of Locks and Degrees of Consistency in a Shared Data Base , 1998, IFIP Working Conference on Modelling in Data Base Management Systems.

[2]  Wolfgang Effelsberg,et al.  Principles of database buffer management , 1984, TODS.

[3]  Theo Härder,et al.  Observations on optimistic concurrency control schemes , 1984, Inf. Syst..

[4]  Andreas Reuter,et al.  Concurrency on high-traffic data elements , 1982, PODS.

[5]  Gunter Schlageter,et al.  Optimistic Methods for Concurrency Control in Distributed Database Systems , 1981, VLDB.

[6]  Rudolf Bayer,et al.  Parallelism and recovery in database systems , 1980, TODS.

[7]  J. T. Robinson,et al.  On optimistic methods for concurrency control , 1979, TODS.

[8]  Michael Stonebraker,et al.  Locking granularity revisited , 1979, ACM Trans. Database Syst..

[9]  Philip A. Bernstein,et al.  Formal Aspects of Serializability in Database Concurrency Control , 1979, IEEE Transactions on Software Engineering.

[10]  Michael Stonebraker,et al.  Effects of locking granularity in a database management system , 1977, TODS.

[11]  J. Gray,et al.  The notions of consistency and predicate locks in a database system , 1976, CACM.

[12]  Daniel A. Menascé,et al.  Optimistic versus pessimistic concurrency control mechanisms in database management systems , 1982, Inf. Syst..

[13]  Rudolf Bayer,et al.  Dynamic Timestamp Allocation for Transactions in Database Systems , 1982, DDB.

[14]  Jim Gray,et al.  Notes on Data Base Operating Systems , 1978, Advanced Course: Operating Systems.