This document discusses a transaction locking system. It presents a table that outlines the different states a transaction can be in, including reading, writing, aborting, and committing. It also describes issues that may occur like deadlocks and how the system handles unlocking and updating records. The goal is to ensure concurrent executions are isolated and equivalent to serial executions to avoid inconsistencies.
1. ;,3( ** -,-11,?
;,3( ** -,-11,?
E (,C E ,
29* 21;1 MT /9C T (2-C T 2(23+ ( 312+(22(-,N
T E-++(3C E -13
/-22((* (* /1***(2+- 31E
E 1-**)
*-1?(-,E /9 MN
U
-/1?(-,( (
KE (2- MN
-/1?(-,( ( 312+(22(-, M3N
V
62 ( *(,3 MN
W
3
T
3
U X
3 3
V
128. M UN
9,- 9, 31,2?(-, ,31 (, 233- ( (3
2( 7; 9,
L E
T 6, 9, 1(2-12 -,31-**3 U
9,O62 22(; (,31/133 -+ *-)C -/- 9,
U 6, 9, 1(2-12 -,31-**3 T 13- 3+/- (, 62 M2,? * 4+-93N * 31,2?(-,
;(, -143F
T U