#DBMS #Transactions #Serializability Conflict Serializability | Conflict Serializable Schedule
Channel: Tech Educators
Date: 2021-04-16

#DBMS #Transactions #Serializability Conflict Serializability | Conflict Serializable Schedule
In Concurrency control, serial schedules have less resource utilization and low throughput. To improve it, two or more transactions are run concurrently. But concurrency of transactions may lead to inconsistency in database. To avoid this, we need to check whether these concurrent schedules are serializable or not.

What is conflict Serializable Schedule?
Conflict Serializable: A schedule is called conflict serializable if it can be transformed into a serial schedule by swapping non-conflicting operations.

What are conflicting Operations/Instructions?
Conflicting operations: Two operations are said to be conflicting if all conditions satisfy: 
1) They belong to different transactions
2) They operate on the same data item
3) At Least one of them is a write operation

Example: –

1. Conflicting operations pair (R1(A), W2(A)) because they belong to two different transactions on same data item A and one of them is write operation.
2. Similarly, (W1(A), W2(A)) and (W1(A), R2(A)) pairs are also conflicting.
3. On the other hand, (R1(A), W2(B)) pair is non-conflicting because they operate on different data item.
4. Similarly, ((W1(A), W2(B)) pair is non-conflicting.

Do like, share, comment and subscribe my YouTube channel.