Register

Self Doubt on Polygraphs

• edited by
241 views
1 votes
1 votes
If the precedence graph has a cycle,then will the polygraph also have a cycle? Why or Why not?
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
abhinowKatore asked Sep 8, 2022
262 views
Self Doubt on serializable
If a schedule is not conflict-serializable. Is it serializable?
If a schedule is not conflict-serializable. Is it serializable?
User Avatar
0 votes
0 votes
0 answers
2
kd..... asked Apr 30, 2019
687 views
Self Doubt on SQL AND operator
Here why does the 5th query select * from employees natural join works_on where PID = 'X' AND PID='Y'; is not working The queries are The output are
Here why does the 5th query select * from employees natural join works_on where PID = 'X' AND PID='Y'; is not workingThe queries are The output are
User Avatar
0 votes
0 votes
2 answers
3
ashunimbz asked Mar 30, 2019
589 views
Self doubt on 2PL protocol
How can 2PL protocol ( simple one ) ensure conflict serializability even though it cannot ensure freedom from deadlock ? I mean ,if a schedule is conflict serializable it has a conflict equivalent to a serial schedule and serial schedules won't have deadlocks .Right ?
How can 2PL protocol ( simple one ) ensure conflict serializability even though it cannot ensure freedom from deadlock ?I mean ,if a schedule is conflict serializable it...
User Avatar
Link Copied!