edited by
374 views
1 votes
1 votes
conflict serialization or not?

$R1(A), R2(A),W2(A),commit_2,W1(A) ,commit_1$
edited by

1 Answer

2 votes
2 votes

As T2 is committing before the W(A) operation of T1 there  is no dependency of T1 on T2. So, the precedence graph does not contain any cycle.

Hence the schedule is conflict serializable.

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
1 answer
2
Harsh Saini_1 asked Dec 27, 2023
398 views
How many total $Conflict$ $Serializable$ $Schedules$ are possible that can be formed by $T1$ and $T2?$$T1:$ $r_1(A)$ $r_1(B)$ $w_1(B)$$T2:$ $r_2(B)$ $r_2(A)$ $w_2(B)$
0 votes
0 votes
1 answer
3
sambey4 asked Oct 16, 2021
316 views
Find Total no of conflict serializable and view serializableT1: R1(A) W1(A) R1(B) W1(B)T2: R2(A) W2(A) R2(B) W2(B)
2 votes
2 votes
1 answer
4
srestha asked Jan 24, 2018
837 views
It is not conflict serializable, So, why not option A) ??