Log In
1 vote

Is there a chance for Deadlock in Graph based protocol?

in Databases 246 views

2 Answers

0 votes
As far As i know  No, Graph based protocol completely avoid Deadlocks.

I tried but didn't find any example
0 votes

In this I have shared a table having all types of lock classified as serializble recoverable deadlock-free

Related questions

1 vote
2 answers
I have been reading about the tree protocol as an approach in locking management in databases. I read that it is deadlock free but I am not sure how it works. Example: Assume that T1 has locked B, D, E in exclusive mode. According to the rules: T2 can lock H (allowed by ... lock G it has to lock D but D is locked by T1 so it has to wait. Hence deadlock. What am I misunderstanding in the algorithm?
asked Jul 25, 2017 in Databases shashank023 1.6k views
0 votes
0 answers
In Graph based Protocol :- Why acquireing second lock on a data item needs to lock their parent data in tree . please explain
asked Jun 17, 2016 in Databases indrajeet 326 views
1 vote
5 answers
I know that every schedule produced by the Timestamp-based protocol is conflict serializable. But is vice versa is true? Means is all conflict serializable schedules produced by timestamp based protocol ?
asked Jan 21, 2017 in Databases lifeisshubh 985 views