Comparison of immediate-update and workspace transactions: serializability and failure tolerance

Abstract

A theoretical study of concurrency control and failure tolerance which includes both immediate-update (IU) and workspace (WS) transactions is presented. All previous formal approaches only consider IU transactions. A WS transaction first reads objects and updates them only in its private workspace; the objects are written only after the WS transaction commits. In order to examine execution correctness for both transaction models, it is necessary to reshape serializability theory. The framework constructed here handles both transaction and system failures and covers IU and WS transactions. The results show that the two transaction types impose different conditions on schedulers and recovery algorithms and deny the fact that WS transactions require optimistic schedulers and 'intention list' recovery. In comparing the two models, some histories of WS transactions which could not be obtained with IU transactions are given.<>