Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Appears in the Proceedings of the ACM SIGMOD International Conference on Management of Data, San Jose, CA, May 1995 Efficient Optimistic Concurrency Control
 

Summary: Appears in the Proceedings of the ACM SIGMOD International Conference on Management of Data, San Jose, CA, May 1995
Efficient Optimistic Concurrency Control
Using Loosely Synchronized Clocks
Atul Adya Robert Gruber Barbara Liskov Umesh Maheshwari
Laboratory for Computer Science,
Massachusetts Institute of Technology,
545 Technology Square, Cambridge, MA 02139
fadya,gruber,liskov,umeshg@lcs.mit.edu
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,

  

Source: Adya, Atul - Google Labs

 

Collections: Computer Technologies and Information Sciences