COMPLETE SCHEDULE A schedule S of n transactions T I T2 Tn is said to be a

Complete schedule a schedule s of n transactions t i

This preview shows page 29 - 34 out of 53 pages.

COMPLETE SCHEDULE A schedule S of n transactions T I , T2, ••• , Tn' is said to be a complete schedule if the following conditions hold: The operations in S are exactly those operations in TI , T2, •.• , Tn' including a commit or abort operation as the last operation for each transaction in the schedule. For any pair of operations from the same transaction Ti, their order of appearance in S is the same as their order of appearance in T; For any two conflicting operations, one of the two must occur before the other in the schedule ." 29
Image of page 29
Image of page 30
Image of page 31
32
Image of page 32
ON
Image of page 33
Image of page 34

You've reached the end of your free preview.

Want to read all 53 pages?

  • Winter '17

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture