retagged by
997 views
0 votes
0 votes

"Number of possible conflict equivalent serial schedules to some non-serial schedule is total number of topological sorts of its precedence graph."

I haven't read this method anywhere yet but I found it by myself while solving some problems, and tried on several problems which all are giving me a correct answer, please can anyone refer me to standard(reference) books about this!(I found that,too but failed)

retagged by

1 Answer

2 votes
2 votes

A schedule S is conflict serializable if and only if its precedence graph is acyclic.
(An equivalent serial schedule in this case is given by any topological sort over the
precedence graph.)

- Database Management System by Raghu Ramakrishnan and Johannes Gehrke Second Edition Pg No. 542

So if there are more than one topological sort possible for a given precedence graph then surely that will give the number of conflict equivalent serial schedules possible.

HTH

Related questions

1 votes
1 votes
0 answers
1
Anup patel asked Dec 26, 2017
415 views