Question: Question 5. Transaction processing techniques (20 marks) (a) Consider the following transactions T and U. T: x = read (i); write(j,44); U: x = write(1,55);
Question 5. Transaction processing techniques (20 marks) (a) Consider the following transactions T and U. T: x = read (i); write(j,44); U: x = write(1,55); write(j,66); Assuming that the initial values of a, and a; are 10 and 20, respectively. Describe and show an interleaving of the transactions T and U that is serially equivalent (b) What is a Deadlock? How it can be prevented, detected and recovered? Provide some scenarios and concrete examples to answer the questions. (c) Describe the two-phase commit protocol distributed algorithm. Use pseudocode to outline the algorithm. (d) List and describe the ACID properties of transactions. Provide examples for each of the properties
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
