On the Serializability Theorem for Nested Transactions

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.