Register

conflict euivalence

• edited by
376 views
0 votes
0 votes
S1=2RB 1RA 1WB 2WA

S2=1RA 2RB 1WB 2WA

are these schedules are conflict equivalent or not?

as  by swapping the orders of first two non conflicting pair operations(1RA 2RB) we can get s1 to s2 schedule so by definitiion s1 and s2 should be conflict equivalent but the precedence of conflictions pairs is not same in s1 and s2.  pls explain???
• edited by
User Avatar

1 Answer

2 votes
2 votes

two schedule is conflict equal if

  • Transaction of s1 and s2 must be same

  • Every conflict pair of s1 and s2 must be same.

  • Precedence graph of s1 and s2 must be same.

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Harsh Saini_1 asked Dec 27, 2023
396 views
Number of Conflict Serializable Schedules
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)$
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)$
User Avatar
1 votes
1 votes
2 answers
3
Chaitanya Kale asked Oct 7, 2022
718 views
Conflict and view equivalence
If two schedules are conflict equivalent then can we definitely say that they are also view equivalent?
If two schedules are conflict equivalent then can we definitely say that they are also view equivalent?
User Avatar
0 votes
0 votes
1 answer
4
sambey4 asked Oct 16, 2021
315 views
conflict serializable
Find Total no of conflict serializable and view serializable T1: R1(A) W1(A) R1(B) W1(B) T2: R2(A) W2(A) R2(B) W2(B)
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)
User Avatar
Link Copied!