Recoverable Schedule| Cascadeless Schedule| Strict Schedule in DBMS

Recoverable Schedule| Cascadeless Schedule| Strict Schedule in DBMS

If a transaction does a dirty read operation from an uncommitted transaction and commits before the transaction from where it has read the value, then such a schedule is called an irrecoverable schedule , otherwise recoverable schedule.

If in a schedule, failure of one transaction causes several other dependent transactions to rollback or abort, then such a schedule is called as a Cascading Rollback or Cascading Abort or Cascading Schedule. It simply leads to the wastage of CPU time. When a transaction is not allowed to read data until the last transaction which has written it is committed or aborted, these types of schedules are called Cascadeless schedules.

This Session will be useful for NTA UGC NET-JRF, GATE, KVS, NVS, DRDO, ISRO Computer Science Entrance Examination, and all other Central and State University Examination.

Instagram link~

Facebook Page Link~

#NETJRF #UnacademyUGCNET #NTAUGC #UGCNET #netexam #ugc
#GATECS #netjrfcomputerscience #operatingsystems #GATECompterScience

YOU JUST NEED TO DO
3 MAGICAL THINGS
LIKE
SHARE
&
SUBSCRIBE
TO MY YOUTUBE CHANNEL
📚📚📚📚📚📚📚📚

[krishankant]

the best part is all the three are in a single video❤

[officialhungama]

Today's session is very informative bcs mujhe aaj 1 St time smgh aaya ❣️❣️

[sahilalam]

Thankyou so much you actually clear my doubt ❤

[yagyadhamala]

very nc explain of transection of dbms

[VishalVerma-fvfc]

Thank you mam, this was really helpful and easy to follow

[priyankakunwar]

Mam pls mcq pe video banadijye.।
Taki practise kar sake