Top Banner
.1 Pengendalian Konkurensi Pengendalian Konkurensi Protokol berbasis-penguncian Protokol berbasis-pembatasan waktu Protokol berbasis-validasi Multiple Granularity Skema multiversi Penanganan Deadlock Operasi Insert dan Delete Konkurensi dalam struktur indeks
57
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
  • End of Chapter

    .*

    Partial Schedule Under Two-Phase Locking

    .*

    Incomplete Schedule With a Lock Conversion

    .*

    Lock Table

    .*

    Tree-Structured Database Graph

    .*

    Serializable Schedule Under the Tree Protocol

    .*

    Schedule 3

    .*

    Schedule 4

    .*

    Schedule 5, A Schedule Produced by Using Validation

    .*

    Granularity Hierarchy

    .*

    Compatibility Matrix

    .*

    Wait-for Graph With No Cycle

    .*

    Wait-for-graph With A Cycle

    .*

    Nonserializable Schedule with Degree-Two Consistency

    .*

    B+-Tree For account File with n = 3.

    .*

    Insertion of Clearview Into the B+-Tree of Figure 16.21

    .*

    Lock-Compatibility Matrix