SELF DOUBT DBMS

Question

SUPPOSE I HAVE TWO SCHEDULES S1 AND S2

CASE1:THE ORDER OF CONFLICT PAIRS IN S1 ARE

W1->W2

W1->R2

W1->W3

W1->R2

R2->W1

AND THE ORDER OF CONFLICT PAIRS ARE

W1->W2

W1->W3

W1->R2

W1->R2

R2->W1

HERE IN THESE TWO THE CONFLICT PAIRS ARE SAME BUT THE ORDER IN WHICH THEY ARE OBTAINED ARE DIFFERENT SO ARE SCHEDULES S1 AND S2  STILL CONFLICT EQUIVALENT??

CASE 2:

CASE1:THE ORDER OF CONFLICT PAIRS IN S1 ARE

W1->W2

W1->R2

W1->W3

W1->R2

R2->W1

AND THE ORDER OF CONFLICT PAIRS  IN S2 ARE

W1->W2

W1->R2

W1->W3

R2->W1

IN S1 THE NUMBER OF CONFLICT PAIRS OBTAINED ARE 5 BUT IN S2 IT IS 4(BUT THEY ARE DISTINCT BECZ IN S1 THER IS A DUPLICATE W1->R2) SO STILL CONFLICT EQUIVALENT??

Comments

i didn't get your question, can you write in on paper and upload the pic?

---

i am asking suppose s1 and s2 are any two schedules and suppose for s1 and s2 we have find the conflict pairs given for both now  i am asking are they conflict equivalent

---

check this question, https://gateoverflow.in/245417