Q5: In DBMS, a graph precedence is used to test whether a schedule of concurrent transactions...

Question

Question

Q5: In DBMS, a graph precedence is used to test whether a schedule of concurrent transactions is conflict serializable or not

engineering Computer-Science

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

1.

Using the given schedule, the following points are considered for the required precedence graph :

There is a read write conflict on data item A from transaction T2 to T3 and so there will be an edge from T2 to T3.
There is a read write, write read and write write conflict on data item B from transaction T1 to T2 and so there will be an edge from T1 to T2.

So, the required precedence graph is :

Т1 Т2 T3

2.

The schedule S is conflict serializable because there are no cycles formed in the precedence graph.

3.

In order to construct the serial schedule S ', topological sorting has to be performed on the precedence graph as follows :

The vertex with indegree 0 in the precedence graph is T1.
So, the first transaction in the serial order S ' is T1.
Remove the vertex T1 from the precedence graph.
Now the vertex with indegree 0 in the precedence graph is T2.
So, the next transaction in the serial order S ' is T2.
Remove the vertex T2 from the precedence graph.
The next transaction in the serial order S ' is T3 as there are no more vertices.

So, the serial order S ' is :

T1 ----> T2 ------> T3.

Hence, it is possible to construct a serial schedule S ' that is conflict equivalent to the schedule S.

4.

In the given schedule, there is a dirty read from transaction T2 to transaction T3 on data item A. In addition to this, the transaction T3 commits before the transaction T2.

For this reason, the given schedule is not recoverable.

Add a comment

Answer 2

Similar Homework Help Questions

Q5: In DBMS, a graph precedence is used to test whether a schedule of concurrent transactions...

Q5: In DBMS, a graph precedence is used to test whether a schedule of concurrent transactions is conflict serializable or not. Given the following schedule S with three transactions Ti T read(A) T; read(B) write(A) write(B) read(A) write(A) read(B) write(B) 1. Draw the precedence graph for the schedule S (5 points) 2. Check whether the schedule S conflict serializable or not (5 points) 3. Is it possible to construct a serial schedule S' which is conflict equivalent to the schedule...
1. Consider the following schedule S TI T2 read(A) write(A write(A) write(A (a) Draw the precedence...

1. Consider the following schedule S TI T2 read(A) write(A write(A) write(A (a) Draw the precedence graph of S (b) Is schedule S serializable? If so, name one equivalent serial schedule, and prove equivalence (c) Denote by S"the schedule obtained by replacing the write(A) in T2 with read(A) in S. Is schedule S" serializable? If so, name one equivalent serial schedule and prove equivalence. Otherwise prove that it is not. (d) Denote by S"the schedule obtained by replacing the write(A)...
-Advanced Database- Consider the following transaction schedule, where time increases from top to bottom. T1 T2...

-Advanced Database- Consider the following transaction schedule, where time increases from top to bottom. T1 T2 T3 T4 Read (X) Read(Y) Read(Z) Read(Y) Write(Y) Write(Z) Read(U) Read(Y) Write(Y) Read(Z) Write(Z) Read(U) Write(U) Answer the following questions: Draw the precedence graph of the above schedule. Is this schedule conflict serializable? If yes, show what serial schedule(s) it is equivalent to. If not, explain why. Is this schedule view serializable? If yes, show what serial schedule(s) it is equivalent to. If not,...

2. Given the following three transactions T1 = r1(x); w1(y); T2 = r2(z); r2(y); w2(y); w2(x);...

2. Given the following three transactions T1 = r1(x); w1(y); T2 = r2(z); r2(y); w2(y); w2(x); T3 = r3(z); w3(x); r3(y); Consider the schedule S = r1(x); r3(z); r2(z); w3(x); r2(y); r3(y); w2(y); w1(y); w2(x); a. Draw the precedence graph of schedule S, and label each edge with data item(s). b. Based on the precedence graph, determine whether S is conflict serializable and justify your answer. If it is serializable, specify all possible equivalent serial schedule(s).
2. Given the following three transactions T1 = r1(x); w1(y); T2 = r2(z); r2(y); w2(y); w2(x); T3 ...

2. Given the following three transactions T1 = r1(x); w1(y); T2 = r2(z); r2(y); w2(y); w2(x); T3 = r3(z); w3(x); r3(y); Consider the schedule S = r1(x); r3(z); r2(z); w3(x); r2(y); r3(y); w2(y); w1(y); w2(x); a. Draw the precedence graph of schedule S, and label each edge with data item(s). b. Based on the precedence graph, determine whether S is conflict serializable and justify your answer. If it is serializable, specify all possible equivalent serial schedule(s).
Consider the following schedule. The actions are prefixed with the transaction name and are listed in...

Consider the following schedule. The actions are prefixed with the transaction name and are listed in the order they’re scheduled. S: T2:R(Y), T1:R(X), T1:W(X), T3:R(Y), T3:W(X), T1:W(Z), T2:R(X), T3:R(Z) a. Draw the dependency graph for S. b. Is S serializable? c. Is S conflict serializable? If so, what is the conflict equivalent serial schedule?

1. What is the difference between Two-Phase Locking (2PL) and Strict Two-Phase Locking? What condition to Strict 2PL prevent that 2PL does not prevent? 2. What are deadlocks? What are two techniques...

1. What is the difference between Two-Phase Locking (2PL) and Strict Two-Phase Locking? What condition to Strict 2PL prevent that 2PL does not prevent? 2. What are deadlocks? What are two techniques for detecting and resolving deadlocks? 3. In the figure below, R(X, y) means read database item X into variable y and W(X, y) means write variable y into database item y. Column T1 shows transaction T1's operations and column T2 shows T2's operations. Columns Aand_B show the values...
Question 5. (20pts) (Briefly justify your answer) 1) Consider three transactions: T1, T2 and T3. Draw...

Question 5. (20pts) (Briefly justify your answer) 1) Consider three transactions: T1, T2 and T3. Draw the precedence graph for the following schedule consisting of these three transactions and determine whether it is conflict serializable a) (5points) S: R1(X); R3(Z); W2(X); RI(Z); R3(Y); W2(Y), R3(Z), W1(Z), b) (5points) S: RI(X); R3(Z); W20x); RI(Y); R2(Y); W3(Y); R3(Z); WI(Z);
SQL question Consider the three transactions T1, T2 and T3, and the schedules S1, S2, S3...

SQL question Consider the three transactions T1, T2 and T3, and the schedules S1, S2, S3 and S4 given below. Which of the schedules is (conflict) serializable? The subscript for each database operation in a schedule denotes the transaction number for that operation. For each schedule, show all conflicts, draw the precedence graph, determine and write down if it is serializable or not, and the equivalent serial schedules if exist. T1: r1(x); w1(x); T2: r2(x); T3: r3(x); w3(x); S1: r1(x);...

Consider the following schedule that performs actions taken by transactions T1 and T2 on database objects...

Consider the following schedule that performs actions taken by transactions T1 and T2 on database objects A and B : T1: S(A), R(A), X(B), U(A), R(B),W(B), Commit: U(B) T2: S(B), R(B), X(A), U(B), R(A), W(A), Commit: U(A) Because Strict 2PL is using, this schedule is guaranteed to be conflict serializable. A: True B:False

Q5: In DBMS, a graph precedence is used to test whether a schedule of concurrent transactions...

Homework Answers

Add Answer to:
Q5: In DBMS, a graph precedence is used to test whether a schedule of concurrent transactions...

Post as a guest

Earn Coins