November 10, 20171 min read, 282 words
Published: November 10, 2017 | 1 min read, 282 words
Precedence graph algorithm can be used to find out whether the given concurrent schedule is conflict serializable or not.
Algorithm:
Create the number of node in the graph equal to the number of transactions in the given schedule.
Starting with each and every transaction identify...
CRITIC REVIEWS
There don't seem to be any reviews yet.
PUBLIC REVIEWS
There don't seem to be any reviews yet.