1,662 views
0 0 votes
s1:R1(X)R2(Z)R1(Z)R3(X)R3(Y)W1(X)C1W3(Y)C3R2(Y)W2(Z)W2(Y)C2 S2:R1(X)R2(Z)R1(Z)R3(X)R3(Y)W1(X)W3(Y)R2(Y)W2(Z)W2(Y)C1C2C3

S3:R1(X)R2(Z)R3(Z)R1(Z)R2(Y)W1(X)C1W2(Z)W3(Y)W2(Y)C2C3

WHICH of this is true ? please verify

a)s1 cascadeless, recoverable but not strict

b) s1 and s2 irrecoverable

c) s1 s3 cascadeless and recoverable and s2 recoverable

d)all irrecoverable

1 Answer

2 2 votes
Recoverability
A recoverable schedule is one where, for each pair of Transaction Ti and Tj such that Tj  reads data item previously written by Ti   the commit operation of Ti  appears before the commit operation Tj .
 
Cascadeless Schedule
Formally, a cascadeless schedule is one where for each pair of transaction Ti  and Tj  such that Tj  reads data item, previously written by Ti   the commit operation of Ti  appears before the read operation of Tj .
 

Strict

A schedule is strict - has the strictness property - if for any two transactions T1, T2, if a write operation of T1 precedes a conflicting operation of T2 (either read or write), then the commit event of T1 also precedes that conflicting operation of T2.
 
here w(y) of T3 happens before r(y) of T2
and commit operation c3 is before the read operation of T2.
So, it is cascadeless schedule
And we know Every Cascadeless schedule is also recoverable schedule.
it is also irrecoverable and no chance for cascadeless
it is cascadeless and recoverable. Because it is not violating any rule of cascadeless or recoverable

S1- cascadeless recoverable and  strict

S2- cascading irrecoverable

S3- cascadeless recoverable

• edited by
Position:
Show:

Related questions

0 0 votes
0 0 answers
275
275 views
GO Classes asked Feb 17
275 views
Find correct query for counting Teamsize.SQL Query $1$ SQL Query $2$ SQL Query $3$ SQL Query $4$  
1 1 vote
0 0 answers
263
263 views
GO Classes asked Feb 17
263 views
Consider two relations $R$ and $S$ with attributes $p$ and $s$.The following tuple relational calculus (TRC) query is given:\[\{\, t \mid t \in R \ \land\ (\exists z \in...
0 0 votes
0 0 answers
230
230 views
GO Classes asked Feb 17
230 views
Relational Algebra Question.The query was like, $\pi (\sigma\dots\bowtie\dots)\bowtie(\sigma\dots\bowtie\dots)$Asking : no. of tuples in output.zero tuple one tuple two t...
0 0 votes
1 1 answer
268
268 views
GO Classes asked Feb 17
268 views
Consider the ER Model with two entity set :$E_1 (a_{11}, a_{12}, a_{13})$ $E_2 (a_{21}, a_{22}, a_{23})$where, $a_{11}$ is primary key.$a_{21}$ is primary key.$a_{22}$ is...