Start learning →

From strictest to weakest, the correct hierarchy of schedules is

Arecoverable > strict > cascadeless
Bcascadeless > recoverable > strict
Cstrict > cascadeless > recoverable
Dthey are independent properties, no hierarchy exists
Answer & Solution
Correct answer: C. strict > cascadeless > recoverable
Every strict schedule is cascadeless (no read of uncommitted data follows from no read OR write of uncommitted data). Every cascadeless schedule is recoverable. So strict implies cascadeless implies recoverable. The reverse implications do not hold recoverable is the weakest of the three, strict the strongest.
Practise this question with Quill — GATE CSE →

Keep practising Database Management Systems

Browse all Database Management Systems questions for GATE CSE, or explore more Computer Science topics.

Start a Database Management Systems lesson →
Related questions