This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: on Distributed Transaction I. Give an example to show the problem of not meeting the isolation requirement. Question 3 Give an example of a concurrent schedule for a distributed system in which two transactions are serially equivalent at each server but is not serially equivalent globally. Question 4 Consider the following concurrent schedule. Draw the serialization graph for the schedule. Is it serializable? Explain your answer. If the scheduler adopts a serial execution method for executing the transactions, define the new schedule. Ta Tb Tc Read(x) Write(y) Read(y) Write(y) Write(x) Commit Write(z) Commit Commit Question 5 What is the main problem of non-serializablility? Consider the following schedule, what will be the problem if T2 is aborted instead of committed? T1 T2 Write(x) Read(x) Write(y) Write(y) Commit Commit...
View Full Document
This note was uploaded on 01/17/2011 for the course CS CS3283 taught by Professor Kylam during the Spring '10 term at City University of Hong Kong.
- Spring '10