Results 1 to 1 of 1
Thread: Precedence Graph
Jan 4, 2010, 09:50 #1
I'm not sure if someone will answer this question but i will ask anyway.
Basically i am trying to understand precedence graphs in terms of serializability.
Lets say for example i have the following transaction schedules:-
read(T1, balx), write(T1, balx), read(T2, balx), write(T2, balx), read(T3, balx), commit(T1), commit(T2), commit(T3)
Can someone help?