Scribd Logo
Upload

Welcome to Scribd!

  • 174 views

    Recoverability and Serializability

    Uploaded by

    Rami Reddy
    Recoverability and Serializability characterizes transaction schedules based on their recoverability and serializability. Recoverable schedules can recover from failures without cascaded rollbacks, while cascadeless schedules avoid cascaded rollbacks. Serializable schedules are conflict equivalent to a serial schedule and produce the same result as executing transactions one at a time, making concurrency control easier to implement than verifying full serializability. Most databases use locking to achieve serializability.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd

    Recoverability and Serializability

    Uploaded by

    Rami Reddy
    174 views3 pages
    Recoverability and Serializability characterizes transaction schedules based on their recoverability and serializability. Recoverable schedules can recover from failures without cascaded rollbacks, while cascadeless schedules avoid cascaded rollbacks. Serializable schedules are conflict equivalent to a serial schedule and produce the same result as executing transactions one at a time, making concurrency control easier to implement than verifying full serializability. Most databases use locking to achieve serializability.

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Recoverability and Serializability characterizes transaction schedules based on their recoverability and serializability. Recoverable schedules can recover from failures without cascaded rollbacks, while cascadeless schedules avoid cascaded rollbacks. Serializable schedules are conflict equivalent to a serial schedule and produce the same result as executing transactions one at a time, making concurrency control easier to implement than verifying full serializability. Most databases use locking to achieve serializability.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    174 views3 pages

    Recoverability and Serializability

    Uploaded by

    Rami Reddy
    Recoverability and Serializability characterizes transaction schedules based on their recoverability and serializability. Recoverable schedules can recover from failures without cascaded rollbacks, while cascadeless schedules avoid cascaded rollbacks. Serializable schedules are conflict equivalent to a serial schedule and produce the same result as executing transactions one at a time, making concurrency control easier to implement than verifying full serializability. Most databases use locking to achieve serializability.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    You are on page 1of 3

    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