Computer Science, asked by rathorearyan694, 7 months ago

Define conflict serializabilitv and a conflict serializable schedule? Determine whether the

following schedule is conflict serializable or not

T1:R(X), T2:R(X), T1:W(X), T2:R(Y), T3:R(Z), T2::W(Z), T3:W(X), T3:W(Y), T2:W(Y),

T3:W(Z)​

Answers

Answered by Anonymous
9

Answer:

What is View Serializability?

View Serializability is a process to find out that a given schedule is view serializable or not.

To check whether a given schedule is view serializable, we need to check whether the given schedule is View Equivalent to its serial schedule. Lets take an example to understand what I mean by that.

Given Schedule:

T1 T2

----- ------

R(X)

W(X)

R(X)

W(X)

R(Y)

W(Y)

R(Y)

W(Y)

Serial Schedule of the above given schedule:

As we know that in Serial schedule a transaction only starts when the current running transaction is finished. So the serial schedule of the above given schedule would look like this:

Similar questions