The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+18 votes
2.5k views

Consider the following schedule for transactions T1, T2 and T3:

T1 T2 T3
Read(X)    
  Read(Y)  
    Read(Y)
  Write(Y)  
Write(X)    
    Write(X)
  Read(X)  
  Write(X)  

Which one of the schedules below is the correct serialization of the above?

  1. $T1 \to T3 \to T2$
  2. $T2 \to T1 \to T3$
  3. $T2 \to T3 \to T1$
  4. $T3 \to T1 \to T2$
asked in Databases by Veteran (115k points)
edited by | 2.5k views
0
in T3 are they over writing x value with y value ?

3 Answers

+32 votes
Best answer

Answer is option A.

create precedence graph and apply Topological sort on it to obtain 
$T1 \rightarrow T3 \rightarrow T2$

precedence graph

answered by Boss (31.1k points)
edited by
0
Thanks
+1
How to apply topological sort on a precedence graph?
0

@amarVashishth There should be $2$ edges from $T_3 \text{ to } T_2$, one for $\text{RW(Y)}$ and the other for $\text{WR(X)}$. Isn't it?

0
check for view serializability here.Final write of X is made by T2, so in equivalent serial order T2 should come last.

2 options eliminated this way.

Now, Write (X) of T3 is read by T2, so T3 should precede T2.So, Option (A) suitable.
0
Please help me identify What's the conflict from T1 to T2?
+8 votes

The solution is described here.
            
hence option A is True.

answered by Active (3.6k points)
edited
0
how we apply topological ordering ..i draw the graph but after how to know its  serialize or not
+6 votes
You can use method of conflict serializability graph or precedence graph Ref: Elmasri Navathe. Then serialisation is T1 T3 T2
answered by Boss (11.6k points)
Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
47,903 questions
52,285 answers
182,209 comments
67,715 users