Question: New Entry in database Problem 4 Consider the following schedule of activities from 3 transactions TR1 TR2 TR3 Read(B) Read(A) Write(B) Write(B) Write(A) Read(C) Write(c)
New Entry in database
Problem 4
Consider the following schedule of activities from 3 transactions
| TR1 | TR2 | TR3 |
| Read(B) Read(A) Write(B)
Write(B)
|
Write(A) Read(C)
Write(c) Write(B)
|
Write(c) Read(B)
|
Is this schedule conflicting serializable?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
