Transparent Gif

Department of Computer Science

University of California, Santa Barbara

Abstract

On the Serializability Theorem for Nested Transactions

by: Rodolfo F. Resende, and Amr El Abbadi

Abstract:

The fundamental theorem of the classical serializability theory states thenecessary and sufficient conditions for the conflict serializability of anexecution. In this paper, we extend the correctness criteria of the classicaltheory by presenting a definition of conflict serializability for concurrencycontrol of nested transactions. We define a serialization graph for nestedtransactions and we prove that its acyclicity is a sufficient and necessarycondition for conflict serializability.

Keywords:

Databases, Concurrency, Conflict Serializability, NestedTransactions.

Date:

August 1993 (revised: January 1994)

Document: 1993-20

XHTML Validation | CSS Validation
Updated 14-Nov-2005
Questions should be directed to: webmaster@cs.ucsb.edu