700 views
1 votes
1 votes

Q 40). Which of the following is/are TRUE?

I). Strict schedule is a cascade-less schedule and recoverable schedule.

II). Every cascade-less schedule is recoverable schedule.

III). Every conflict serializable schedule is recoverable.


 $I \ and \ II \ only$

 $II \ and \ III \ only$

 $I \ and \ III \ only$

Please answer with reference why III is false.

I see venn diagram -> https://en.wikipedia.org/wiki/Schedule_%28computer_science%29#Hierarchical_relationship_between_serializability_classes

Here. (Same is used in ans key, but no reference for it !)

1 Answer

0 votes
0 votes

In the venn diagram , it is clear that conflict serializable is not a subset of recoverable schedule so (III) can be false.

Related questions

1.3k
views
1 answers
0 votes
sumit chakraborty asked Nov 26, 2017
1,252 views
In 2PL protocol if all exclusive locks are acquired by transaction in increasing order of their accesses then is the 2PL starvation free ?
386
views
1 answers
0 votes
reena_kandari asked Jan 12, 2017
386 views
How many rows will be there in the output of the following query?
431
views
1 answers
0 votes
firki lama asked Jan 16, 2017
431 views
396
views
1 answers
1 votes
Nishisahu asked Oct 17, 2021
396 views
Consider two relations $R$ and $S$ of size $1200$ bytes and $1000$ bytes respectively. The size of a tuple in both relations is $20$ bytes. The ... loop join is used instead of block nested loop join technique to compute the natural join?