1,543 views

1 Answer

0 votes
0 votes

Let’s say there are 2 transactions in the system (T1 and T2).

Cascadeless schedule:

In Cascadeless Schedule, if a transaction is going to perform read operation on a value, it has to wait until the transaction who is performing write on that value commits.

Say if T1 is performing write operation. Now If T2 wants to read, then it has to wait until T1 commits.

Why it is desirable?

Because the failure of a transaction does not lead to the aborting of any other transaction

When Non – Cascadeless schedule are desirable?

  • Cascadeless schedule may result in less concurrency. So if the failure occurs very rarely then we can choose “increased concurrency” by using Non – Cascadeless schedule

Related questions

0 votes
0 votes
0 answers
1
akash.dinkar12 asked Apr 1, 2019
199 views
When a transaction is rolled back under timestamp ordering, it is assigned a new timestamp. Why can it not simply keep its old timestamp ?
0 votes
0 votes
0 answers
2
akash.dinkar12 asked Apr 1, 2019
294 views
What is a recoverable schedule ? Why is recoverability of schedules desirable? Are there any circumstances under which it would be desirable to allow nonrecoverable sched...
0 votes
0 votes
0 answers
3
akash.dinkar12 asked Apr 1, 2019
1,415 views
Consider the precedence graph of Figure 15.18. Is the corresponding schedule conflict serializable ? Explain your answer.
0 votes
0 votes
0 answers
4
akash.dinkar12 asked Apr 1, 2019
833 views
Since every conflict-serializable schedule is view serializable, why do we emphasize conflict serializability rather than view serializability?