Serializability and Recoverability in DBMS
Serializability
A schedule is said to be Serializability if it is equivalent to some serial schedule of n number of transactions. There are two types of Serializability :
- View Equivalence
- Conflict Equivalence
View Equivalence
Two schedules would be View Equivalence if the transactions in both the schedules perform similar actions in a similar manner.
Conflict Equivalence
Two schedules would be Conflict Equivalence if they have the following properties:
- Both belong to separate transactions.
- Both accesses the same data item.
- At least one of them is “write” operation.