in Databases
56 views
0 votes
0 votes
What is Proof/Explanation for complexity to test if a schedule is conflict serializable is O(n^2) whereas for view serializable is O(2^n)-Exponential ?
in Databases
56 views

Please log in or register to answer this question.

Related questions

1 vote
1 vote
1 answer
2