Computer Science, asked by sakshishah825, 3 months ago

explain conflict serializibility and view serializibility with example

Answers

Answered by priyadarsini33
6

Answer:

Serializable Schedule :

A transaction schedule is serializable if its outcome is equal to the outcome of its transactions executed serially i.e. sequentially without overlapping in time. A serializable schedule always leaves the database in consistent state. A serial schedule is always a serializiable schedule because a new transcation only starts when the older one has finished execution.

Example –

Let us consider the following schedule and see if it is serializable.

T1 T2

R(X)

R(X)

R(Y)

W(Y)

R(Y)

W(X)

Now, let us figure out if the above schedule is serializable.

Swapping R(X) of T1 and R(Y) of T2.

Swapping R(X) of T1 and W(Y) of T2.

T1 T2

R(X)

R(Y)

W(Y)

R(X)

R(Y)

W(X)

Similar questions