0% found this document useful (0 votes)
26 views4 pages

Conflict Ser

Conflict Ser of dbms

Uploaded by

krithic
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
26 views4 pages

Conflict Ser

Conflict Ser of dbms

Uploaded by

krithic
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Conflict Serializable Schedule

o A schedule is called conflict serializability if after


swapping of non-conflicting operations, it can
transform into a serial schedule.
o The schedule will be a conflict serializable if it is
conflict equivalent to a serial schedule.

Conflicting Operations

The two operations become conflicting if all conditions


satisfy:

1. Both belong to separate transactions.


2. They have the same data item.
3. They contain at least one write operation.

Example:

Swapping is possible only if S1 and S2 are logically equal.

Here, S1 = S2. That means it is non-conflict.


Here, S1 ≠ S2. That means it is conflict.

Conflict Equivalent

In the conflict equivalent, one can be transformed to


another by swapping non-conflicting operations. In the
given example, S2 is conflict equivalent to S1 (S1 can be
converted to S2 by swapping non-conflicting operations).

Two schedules are said to be conflict equivalent if and only


if:

1. They contain the same set of the transaction.


2. If each pair of conflict operations are ordered in the
same way.
Example:

Schedule S2 is a serial schedule because, in this, all


operations of T1 are performed before starting any
operation of T2. Schedule S1 can be transformed into a
serial schedule by swapping non-conflicting operations of
S1.
After swapping of non-conflict operations, the
schedule S1 becomes:

T1 T2

Read(A)
Write(A)
Read(B)
Write(B)
Read(A)
Write(A)
Read(B)
Write(B)

Since, S1 is conflict serializable

You might also like