Optimistic Concurrency Control for Nested Distributed Transactions

Abstract

Optimistic concurrency control techniques allow atomic transactions (or actions for short) to execute without synchronization, relying on commit-time validation to ensure serializability. Previous work in this area has focussed on single-level actions. This thesis extends previous work on optimistic concurrency control to distributed system with nested actions.