Scribd
Upload
102 views3 pages

Recoverability and Serializability in DBMS

The document discusses recoverability and serializability of transaction schedules, including recoverable, cascadeless, strict, serial, serializable, result equivalent, and conflict equivalent schedules. It notes that serializability is difficult to verify and most databases use locking to achieve it.

Uploaded by

Rami Reddy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
102 views3 pages

Recoverability and Serializability in DBMS

The document discusses recoverability and serializability of transaction schedules, including recoverable, cascadeless, strict, serial, serializable, result equivalent, and conflict equivalent schedules. It notes that serializability is difficult to verify and most databases use locking to achieve it.

Uploaded by

Rami Reddy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd

Recoverability and Serializability

Characterization of schedules based on Recoverability


• Transaction schedule or history – in brief
• A schedule (or history) S of n transactions T1, T2, …, Tn.
- Order of execution of operations.
• Classification of schedules based on recoverability
- Recoverable Schedule
- Cascadeless Schedule
- Schedules requiring cascaded rollback
- Strict Schedule
Characterization of schedules based on Serializabilty
• Serial Schedule
• Serializable Schedule
• Result equivalent
• Conflict equivalent
• Conflict serializable

Note: Serializable and Serial are not same. They are different.
Serializability is very hard to verify.
In most of the Database Management Systems, the current
approach is using locks.

You might also like