Tech Report CS-91-25
Transaction Control For Cooperative Applications
Sridhar Ramaswamy and Stanley B. Zdonik
We analyze existing models of design transaction control systems. We use the following criteria: flexibility in specifying concurrency control, computational complexity of checking consistency, computational complexity of concurrency control, support for abstraction, and support for recovery. Based on this analysis, we propose a new way of doing concurrency control and recovery. We then discuss the advantages and limitations of this approach and outline open problems in this area.
(complete text in pdf)