Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks.
Atul Adya, Robert Gruber, Barbara Liskov, Umesh Maheshwari:
Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks.
SIGMOD Conference 1995: 23-34@inproceedings{DBLP:conf/sigmod/AdyaGLM95,
author = {Atul Adya and
Robert Gruber and
Barbara Liskov and
Umesh Maheshwari},
editor = {Michael J. Carey and
Donovan A. Schneider},
title = {Efficient Optimistic Concurrency Control Using Loosely Synchronized
Clocks},
booktitle = {Proceedings of the 1995 ACM SIGMOD International Conference on
Management of Data, San Jose, California, May 22-25, 1995},
publisher = {ACM Press},
year = {1995},
pages = {23-34},
ee = {http://doi.acm.org/10.1145/223784.223787},
crossref = {DBLP:conf/sigmod/95},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
This paper describes an efficient optimistic concurrency control
scheme for use in distributed database systems in which objects are
cached and manipulated at client machines while persistent storage and
transactional support are provided by servers. The scheme provides
both serializability and external consistency for committed
transactions; it uses loosely synchronized clocks to achieve global
serialization. It stores only a single version of each object, and
avoids maintaining any concurrency control information on a per-object
basis; instead, it tracks recent invalidations on a per-client basis, an approach that has low in-memory space overhead and no per-object
disk overhead. In addition to its low space overheads, the scheme
also performs well. The paper presents a simulation study that
compares the scheme to adaptive callback locking, the best concurrency
control scheme for client-server object-oriented database systems
studied to date. The study shows that our scheme outperforms adaptive
callback locking for low to moderate contention workloads, and scales
better with the number of clients. For high contention workloads, optimism can result in a high abort rate; the scheme presented here is
a first step toward a hybrid scheme that we expect to perform well
across the full range of workloads.
Copyright © 1995 by the ACM,
Inc., used by permission. Permission to make
digital or hard copies is granted provided that
copies are not made or distributed for profit or
direct commercial advantage, and that copies show
this notice on the first page or initial screen of
a display along with the full citation.
Online Version (ACM WWW Account required): Full Text in PDF Format
CDROM Version: Load the CDROM "Volume 1 Issue 1, SIGMOD '93-'97" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
Michael J. Carey, Donovan A. Schneider (Eds.):
Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, San Jose, California, May 22-25, 1995.
ACM Press 1995 
, SIGMOD Record 24(2), June 1995
Contents
[Index Terms]
[Full Text in PDF Format, 1349 KB]
References
- [1]
- ...
- [2]
- Divyakant Agrawal, Arthur J. Bernstein, Pankaj Gupta, Soumitra Sengupta:
Distributed Optimistic Concurrency Control with Reduced Rollback.
Distributed Computing 2(1): 45-59(1987)
- [3]
- Paul Butterworth, Allen Otis, Jacob Stein:
The Gemstone Object Database Management System.
Commun. ACM 34(10): 64-77(1991)
- [4]
- Michael J. Carey, Michael J. Franklin, Markos Zaharioudakis:
Fine-Grained Sharing in a Page Server OODBMS.
SIGMOD Conference 1994: 359-370
- [5]
- Michael J. Carey, David J. DeWitt, Jeffrey F. Naughton:
The oo7 Benchmark.
SIGMOD Conference 1993: 12-21
- [6]
- Stefano Ceri, Susan S. Owicki:
On the Use of Optimistic Methods for Concurrency Control in Distributed Databases.
Berkeley Workshop 1982: 117-129
- [7]
- ...
- [8]
- Kapali P. Eswaran, Jim Gray, Raymond A. Lorie, Irving L. Traiger:
The Notions of Consistency and Predicate Locks in a Database System.
Commun. ACM 19(11): 624-633(1976)
- [9]
- ...
- [10]
- Michael J. Franklin, Michael J. Carey:
Client-Server Caching Revisited.
IWDOM 1992: 57-78
- [11]
- ...
- [12]
- ...
- [13]
- Jim Gray:
Notes on Data Base Operating Systems.
Advanced Course: Operating Systems 1978: 393-481
- [14]
- ...
- [15]
- ...
- [16]
- ...
- [17]
- Theo Härder:
Observations on optimistic concurrency control schemes.
Inf. Syst. 9(2): 111-120(1984)
- [18]
- H. T. Kung, John T. Robinson:
On Optimistic Methods for Concurrency Control.
ACM Trans. Database Syst. 6(2): 213-226(1981)
- [19]
- Ming-Yee Lai, W. Kevin Wilkinson:
Distributed Transaction Management in Jasmin.
VLDB 1984: 466-470
- [20]
- Barbara Liskov:
Practical Uses of Synchronized Clocks in Distributed Systems.
PODC 1991: 1-9
- [21]
- ...
- [22]
- Barbara Liskov, Paul Johnson, Robert Gruber, Liuba Shrira:
A Highly Available Object Repository for Use in a Heterogeneous Distributed System.
POS 1990: 255-266
- [23]
- Umesh Maheshwari, Barbara Liskov:
Fault-Tolerant Distributed Garbage Collection in a Client-Server Object-Oriented Database.
PDIS 1994: 239-248
- [24]
- ...
- [25]
- ...
- [26]
- ...
Last update Tue Sep 18 00:25:11 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
