Oh my god. You literally saved my ass for tomorrow's quiz. Thank you so much. You explained this in 6 minutes what my professor couldn't do in 3 hours and 15 ppt slides.
All acyclic schedule are serializable however there are serializable histories (i.e., equivalent to serial) that have cyclic conflict graph. Could you please explain it if anyone have an idea? Thanks
Yes. It is non serializable only in the context of conflict serializability. I have mentioned in many videos that until we check view serializability, we cannot say it is non-serializable. Most precisely, even if a schedule is not view serializable, you can still term it as non- view serializable... serializability is an np hard problm
@@nico05eryes, if there is a cycle in the precedence graph formed, the schedule is non- conflict serializable. We check view serialization to confirm about serializability.
This 6 minutes taught and cleared 3 hours worth of university lecture wtf is this magic..
Thank you so much 😊
Legends are watching who has exam tmrow 😂😂
and the trick written in my book is asking me to do the exact opposite of youtubers lectures
In 12 hours 😢
On NXT hour😂
20 min 😭🙏
In 2.5 mins
one of the best videos on serializability and concurrency on Database. Very helpful for GATE preperation.
Thank you so much!
I don't know what to say,the class was crisp and clear🤗🤗🤗🤗,you are a life saver
Oh my god. You literally saved my ass for tomorrow's quiz. Thank you so much. You explained this in 6 minutes what my professor couldn't do in 3 hours and 15 ppt slides.
Tq mam.....I have understood perfectly 😊
Glad to hear that
Legends watching 10 mins before exam with 2x speed😂
Hey wanted to say thank you for the great explanation. Got a test today and you're probably saving me right now hahahaha. God bless :)
thank you ,this really helps❤❤❤❤
I'm so glad!
Helpfull 👍
Glad you think so!
Thank you miss you made this very easy to understand you should also do a lecture on 2PL locking !! it would be much appreciated.
Will do very soon...
@@ritukapurclasses1591 ma'am is that video up on the channel?
Thanks for the nice explanation but why we started with T3 for the order ?
great video! so easy to understand
wow! love you
thank you was very helpful
I have exam tomorrow and this is my brahmahastra
Hello maam i want either this example you have shown is recoverable or not
In first one you missed w(b) to w(c) as we have to draw vertices when ever there is a rw operation or wr or ww..I guess
All acyclic schedule are serializable however there are serializable histories (i.e., equivalent to serial)
that have cyclic conflict graph. Could you please explain it if anyone have an idea? Thanks
there are many such videos on serial and/ equivalent schedules
Yeah...I was looking for this concept.. Kab aayega ..aur aa hi gaya..good explained
+The Celebrity Thank you my pleasure
Ritu Kapur Classes.. Ritu can u please make a video on how to solve Relational Algebra Question. In GATE.. :)
thanx
mam one doubt! in both the example R(B) of T3 will be done first then only W(A) of T1 then why is R(A) in T2 and W(A) in T1 is conflcting
Good voice
Thanks
Tomorrow morning i have exam and today night watching this video
all the best for your exam! I’m sure you will do well!
mam one doubt! in both the example R(B) of T3 will be done first then only W(A) of T1 then why is R(A) in T2 and W(A) in T1 is conflcting
👌👌👌👌
Thanks a lot. You explained this so clearly.
And also your voice is beautiful and soothing.
+Huy Tran Thank you ...
Mam Does commit affect the conflict Serializability?
No it affects recoverability...
In example 1 precedence graph how it is cyclic ?😶
Two conflicts occurring in the form of a cycle as shown in the graph
It is not "non-serialzable",It is "non conflict serializable".
Isn't It?
Yes. It is non serializable only in the context of conflict serializability. I have mentioned in many videos that until we check view serializability, we cannot say it is non-serializable. Most precisely, even if a schedule is not view serializable, you can still term it as non- view serializable... serializability is an np hard problm
@@ritukapurclasses1591
Thank you so much
from what graph do you start?
ist there a rule?
the graph drawn on the right hand side of the table. It is drawn by plotting conflict pairs i am explaining in the video.
@@nico05eryes, if there is a cycle in the precedence graph formed, the schedule is non- conflict serializable. We check view serialization to confirm about serializability.
Exam in 10 mins
all d best 😊