Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Theory of Timestamp-Based Concurrency Control for Nested Transactions
 

Summary: A Theory of Timestamp-Based Concurrency Control
for Nested Transactions
James Aspnes, C.M.U.
Alan Fekete, M.I.T.
Nancy Lynch; M.I.T.
Michael Merritt, AT&T Bell Labs
William Weihl, M.I.T.
Abstract:
We present a rigorous framework for analyzing timestamp-
basedconcurrency control and recovery algorithms for nested
transactions. We define a local correctnessproperty, local
static atomic@, that affords useful modularity. We show that
local static atomicity of each object is sufficient to ensure
global serializability. We presentgeneralizationsof algorithms
due to Reed and Herlihy, and show that each ensures local
staticatomicity.
1 Introduction
Atomic transactions have been widely accepted as a
mechanism for coping with concurrency and failures in
databasesystems. In recent work, researchershave explored

  

Source: Aspnes, James - Department of Computer Science, Yale University
Lynch, Nancy - Computer Science and Artificial Intelligence Laboratory & Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)

 

Collections: Computer Technologies and Information Sciences