Scribd
Upload
247 views

Schedule Based On Serializability

1. The document discusses view equivalence and view serializability in database scheduling. 2. Two schedules are view equivalent if they satisfy three conditions: they involve the same transactions and operations, values read have the same write dependencies, and the last write to an item is the same. 3. A conflict serializable schedule is always view serializable, but the reverse is not necessarily true, as demonstrated by a sample schedule of three transactions.

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
247 views

Schedule Based On Serializability

1. The document discusses view equivalence and view serializability in database scheduling. 2. Two schedules are view equivalent if they satisfy three conditions: they involve the same transactions and operations, values read have the same write dependencies, and the last write to an item is the same. 3. A conflict serializable schedule is always view serializable, but the reverse is not necessarily true, as demonstrated by a sample schedule of three transactions.

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
You are on page 1/ 3

Characterizing Schedules based on Serializability

(Contd…….)
• View equivalence
• View serializability
• Two schedules are said to be view equivalent if the following three conditions hold:
1. The same set of transactions participates in S and S’, and S and S’
include the same operations of those transactions.
2. For any operation Ri(X) of Ti in S, if the value of X read by the operation
has been written by an operation Wj(X) of Tj (or if it is the original value
of X before the schedule started), the same condition must hold for the
value of X read by operation Ri(X) of Ti in S’.
3. If the operation Wk(Y) of Tk is the last operation to write item Y in S,
then Wk(Y) of Tk must also be the last operation to write item Y in S’.
(From – Database Systems by Elmasri & Navathe)
• The premise behind view equivalence – in brief
• Relationship between view and conflict equivalence
- A conflict serializable schedule is also view serializable, but cannot be
vice versa.

• Consider the following schedule of three transactions


• T1: r1(X), w1(X); T2: w2(X); and T3: w3(X):
• Schedule Sa: r1(X); w2(X); w1(X); w3(X); c1; c2; c3;

You might also like