Lec-87: Drawbacks in Shared/Exclusive Locking Protocol with Example | Concurrency Control Part-2

[@shubhamtaluja9770]

How simply you explain things Sir. Won't be able to forget lifetime. Thank you so much :)

[@arijitbarua6183]

Gate Smashers entire channel can cover your Btech syllabus more efficiently than any other University

[@pooo8781]

Satisfied completely ❤❤ from Nepal. It helps me on my DBMS EXAM❤❤

[@twinklegarg1413]

No sir 3:15 it is a serializable schedule T1->T2

[@svaibavbajra]

fair point. non conflict pairs can be swapped i guess

[@doofsCat]

Just chane B to A at bottom of T1... Then construct a precedence graph and see....

[@meetpopat1463]

@@svaibavbajra Exactly

[@newtanagmukhopadhyay4716]

@@doofsCat yea i think he wanted to write A wrote B mistakely.

[@sahil-ti3io]

Thanks sir (real meaning of Teacher) 💜👍🏿

[@maniaccodes]

example shown for first is serializable as R(A) and R(B) are non conflict pair and R(A) and W(B) are also non conflict pair

[@SluciferKm]

I'm also confused there how he said that it cannot be serialized

[@areebaaoun8113]

Exactly

[@rounak3239]

Gurujee shandar jabardast zindabad

[@zeelpatel5559]

sahi padha rahe ho ap.. ekdam mast!

[@anonymousfan9703]

9:00
T1 Ya bechara wait kar rha ha
Sir wait karta reh
Best line from Sir

[@MADDILAKSHMINARAYANA]

God of explanation. Thank you so much sir,

[@lavish532]

jahan pe aap ye prove kar rahe ho ki ye serializable nahi hai, agar usi problem ko precedence graph se solve kia jae to ye serializable hai. Graph mei T1 ki indegree hogi zero. To pehle T1 and fir T2 chalega to ye serializable hai and loop b nahi hoga. ye kese ho sakta hai ?

[@factvortex6509]

loop nhi hoga q k here loop basically means that the starting transaction in the preceding graph should not end on the same starting transaction i.e of t1 is starting transaction then according to precedence graph it should not come again to itself
.
.
hope doubt is clear

[@fastio8489]

That's true. The schedule isn't serial but is definitely serializable. Should have come up with a better e.g.

[@prathamyadav3105]

@@fastio8489 yeah instead of r(b) and w(b) at last in t1, he could have shown r(a) and w(a) again.

[@atishsinhaa]

Well said

[@kirtisharma4697]

Thanks Sir .... My ugc Net xam is on 4th Dec...need ur blessings Sir 🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏

[@ashupochh8310]

Did you qualify?

[@aviraljain6713]

@@ashupochh8310 lol😂

[@aryangawade3473]

Clear hua ?

[@panditsanjay7762]

No words for explanation! fabulous sir keep it up ....

[@sachalraja1054]

aise kese dedun...xD MAST EXPLANATION

[@AnkitPatelRewa8821]

Wonderful Explain Nation Topic Sir 🖤🖤😊

[@hakimabahnu7722]

Just amazing.. ✨

[@KapilKumar-xz9ip]

Amazing video sir ♥️

[@prachid3990]

Inn transactions ko mahila kisne bana dia? :p
Continously watching your videos sir, amazing content!!

[@anishjoshi1999]

love from nepal

[@abhaychanana7240]

Really simple and fine explanation.

[@ashstories6489]

best lecture sir

[@happycoding5163]

understood each and everything...!!!!!

[@PrajaBewithMe]

good explanation sir

[@tusharpanchal7013]

This was a great one ❤️

[@akarshitkumar6744]

sir according to precednce graph transactions are conflict serializable

[@SanjanaRamya-hd5kw]

00:01 Shared exclusive locking may not always guarantee serializability
01:30 Concurrent protocol and serializable schedule
02:45 Exclusive and shared locks are used in transactions to achieve serializability.
04:07 Exclusive and shared locks in a transaction.
05:30 Deadlock is a situation where two or more processes are waiting for each other to release resources.
06:59 Deadlock is a special case where exclusive locks lead to a deadlock problem
08:24 Starvation and waiting in lock methodology
09:40 Shared exclusive lock is a protocol to manage locks

[@krishanudutta2943]

Excellent lecture it was sir

[@animationcrust1993]

Good explanation sir ji 😊❤️

[@Rehan_kashmari_7]

Superb sir thank you so much

[@Draxper]

Thanks sir, very helpful video

[@geetahoodakids660]

Great explanation sir g thank you

[@SarveshTravelDiaries]

thanks sir.....great explaination

[@priyankabuqrdwaj4964]

thank you so much sir for your kind information

[@dileshchouhan9527]

i have doubt after 1:42 timestamp like how it is loop so in T1 w(a) and T2 r(a) is right ,this make arrow but T2 r(a) how it will make arrow because in T1 there is no w(a) after the timeline of T2 r(a).

[@AshishKumar-zx6zz]

Sir pehle T1 me 2:10 me x lock lagaye, further unclock kiye 2:39 me.
Ab lock release ho rhe h to phir lock kaise lag gya 2:58

[@komalgupta356]

Thank u sir. 🙏

[@ramyach2445]

1st comment bhai thanks alot

[@sheilbala9069]

Genius

[@vanshshrivastava5885]

ty

[@pradeexsu]

Thank u sir

[@agx111]

cascade rollback can also be a drawback of this ??

[@sehrishfirdous4600]

Thanks alot sir...Plz will you make a videos about Artificial Intelligence and object oriented Analysis and design ..

[@gulnazsiddiqui4473]

You are great teacher..... Plz make a video on multilevel security, data mining, clustring my exam tnearst

[@diplukdas]

Need 3x option in youtube

[@myview9553]

3:20 ye serializable ni hoga, B to alg h !!!
although your videos are suberb but i have a doubt on this. can someone please explain

[@mohithguptakorangi1766]

you can take R(A) & W(A) in T1 at the bottom instead of R(B) & W(B) OR Add R(A) & W(A) at the bottom of T1
He was in a hurry and explained it wrong I guess

[@lakshayjain4857]

Sir sometimes read happens from database or sometimes happens from another transaction even when it is not committed like in problem 2

[@ShubhamJadhao-b3p]

🙏🙏🙏

[@ShubhamJadhao-b3p]

Thanks

[@zaynkhan464]

Is it possible to issue a read lock again to same object when previous read lock is in contact. And there is never release lock mechanism?

[@sparks8754]

7:23, I don't know why I am laughing so hard

[@gauravbhosle281]

Sir, cascading rollback bhi ho sakta hai esme

[@sakshipabrekar8872]

sir who both are requesting to unlock ? G x(A) and G x(B) ?

[@sakshipabrekar8872]

sir please answer tomorrow is my exam

[@sakshipabrekar8872]

in deadlock

[@anmolpandey5692]

both are requesting the lock

[@anmolpandey5692]

t1 and t2

[@adarshagrawal6855]

irrecoverrable or casacadeless ne diff kya h?

[@55_hetpatel74]

waah

[@chiragjaiswal9387]

kuch nh smjhaaa firse dekhna paregaaa😂

[@KumarAnalytic]

Sir SQL server me replication and not for replication pr tutorial banao

[@vkjvivek7]

1:36 (ruclips.net/video/UsqtDD1VriY/видео.html)
So if T2 is executed first and then T1 as they both are concurrent we dont know which one is selected by query engine.
this will make it serializable or not?

[@ankitmehta4133]

i was going to skip this topic, but my gf told me take the idea from gate smashers , now I got it well
thanks man
continuing all your vidoes.
next i will start OS

[@King_of_my_family143]

[@meetbhardiwala1472]

isme bhi kabhi bol raha ki ek jagah access nahi denge aur usi same case mein bol raha hai ki wait karega

[@VickyKumar-si5lb]

Ghh

[@rdxgladion4906]

T1 ke sath sahi nhi hua

[@ashupipalia6046]

thanks sir

[@simasingh5587]

thank you sir

[@GauravSingh-wp6gx]

Thanks sir

[@dhaneshpt8641]

Thank you sir.

[@prashreetiwasti7264]

Thank you sir

[@viralvideoa]

Thank you sir

[@divyaagarwal3091]

Thankyou sir