edited by
1,522 views
0 votes
0 votes

Consider the following schedules involving two transactions.

$S_1 : r_1(X) ; r_1(Y); r_2(X); r_2(Y); w_2(Y); w_1(X)$

$S_2 : r_1(X) ; r_2(X); r_2(Y); w_2(Y); r_1(Y); w_1(X)$

Which one of the following statements is correct with respect to above?

  1. Both $S_1$ and $S_2$ are conflict serializable
  2. Both $S_1$ and $S_2$ are not conflict serializable
  3. ​​​​​​​$S_1$ is conflict serializable and $S_2$ is not conflict serializable​​​​​​​
  4. ​​​​​​​$S_1$ is not conflict serializable and $S_2$ is conflict serializable​​​​​​​​​​​​​​
edited by

1 Answer

0 votes
0 votes

Option D. S1 is not conflict serializable and S2 is conflict serializable​​​​​​​

Conflict Operations are : RW , WR, WW
Non-Conflict operation : RR
If there is a cycle found then it can't be conflict serializable. In S1 we found a cycle so its not conflict serializable but in S2 there's no cycle found so its conflict serializable.
 

 

Related questions

0 votes
0 votes
2 answers
1
0 votes
0 votes
5 answers
2
Pooja Khatri asked Jul 13, 2018
2,305 views
In RDBMS, which type of Join returns all rows that satisfy the join condition?Inner JoinOuter JoinSemi JoinAnti Join
0 votes
0 votes
5 answers
4
Pooja Khatri asked Jul 13, 2018
4,677 views
In a Hierarchical database, a hashing function is used to locate the ____CollisionRootForeign KeyRecords