in Databases retagged by
806 views
2 votes
2 votes

Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item $x$, denoted by $r(x)$ and $w(x)$respectively. Which one of them is conflict serializable?

  1. $r_1(x);r_2(x);w_1(x);r_3(x);w_2(x)$
  2. $r_2(x);r_1(x);w_2(x);r_3(x);w_1(x)$
  3. $r_3(x);r_2(x);r_1(x);w_2(x);w_1(x)$
  4. $r_2(x);w_2(x);r_3(x);r_1(x);w_1(x)$
  1. $1$
  2. $2$
  3. $3$
  4. $4$
in Databases retagged by
by
806 views

Please log in or register to answer this question.

Answer:

Related questions