edited by
1,214 views
5 votes
5 votes
$1)$ Consider schedule below. Determine whether schedule is cascadeless or not ?

r1(x); r2(z); r1(z); r3(x); r3(y); w1(x); c1; w3(y); c3; r2(y); w2(z); w2(y);c2
edited by

1 Answer

Best answer
7 votes
7 votes

Cascadeless Rollback Recoverable Schedule:

Dirty reads or uncommitted reads NOT ALLOWED

$\Rightarrow$  Given schedule is cascadeless recoverable.

edited by

Related questions

0 votes
0 votes
1 answer
1
Harsh Saini_1 asked Dec 27, 2023
334 views
How many total $Conflict$ $Serializable$ $Schedules$ are possible that can be formed by $T1$ and $T2?$$T1:$ $r_1(A)$ $r_1(B)$ $w_1(B)$$T2:$ $r_2(B)$ $r_2(A)$ $w_2(B)$
1 votes
1 votes
3 answers
2
DebRC asked Nov 2, 2021
703 views
Suppose,T1: W(X), T2: R(X), T1: W(X), T2: Commit, T1: AbortHere we can see T2 is getting committed before T1 aborts, so it is clearly an Irrecoverable schedule but is it ...
3 votes
3 votes
4 answers
3
Nandkishor3939 asked Jan 18, 2019
2,265 views
how many view equivalent schedules are possible for the Sch given below:
3 votes
3 votes
1 answer
4
hacker16 asked Apr 13, 2018
662 views
Given, Transaction T1 has n operation Transaction T2 has m operationProve that, the total...