Available copies replication is applied to data items A and B with replicas Ax, Ay and Bm, Bn. The transactions T and U are defined
T: Read(A); Write(B, 44). U: Read(B); Write(A, 55).
Show an interleaving of T and U, assuming that two-phase locks are applied to the replicas. Explain why locks alone cannot ensure one copy serializability if one of the replicas fails during the progress of T and U. Explain with reference to this example, how local validation ensures one copy serializability.
An interleaving of T and U at the replicas assuming that two-phase locks are applied to the replicas: T U
x:= Read (Ax) lock Ax
Write(Bm, 44) lock Bm
x:= Read (Bm) Wait
Write(Bn, 44) lock Bn • Commit unlock Ax,Bm,Bn •
Write(Ax, 55) lock Ax
Write(Ay, 55) lock Ay
Suppose Bm fails before T locks it, then U will not be delayed. (It will get a lost update). The problem arises because Read can use one of the copies before it fails and then Write can use the other copy. Local validation ensures one copy serializability by checking before it commits that any copy that failed has not yet been recovered. In the case of T, which observed the failure of Bm, Bm should not yet have been recovered, but it has, so T is aborted.
You might also like to view...
The entries in a ListBox are stored in the __________ property.
a. Items.Count b. Items c. Entries d. Text
Photoshop stores multiple image components and enhancements on separate elements called ____________________.
Fill in the blank(s) with the appropriate word(s).
You can optimize the way files are stored by running a disk ____ utility.?
A. ?processing B. ?encryption C. ?service D. ?defragmentation
List the steps you should perform before entering data into a worksheet.
What will be an ideal response?