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 ? Databases transactions-and-concurrency-control conflict-serializable view-serializable + – SakarKoot asked Sep 4, 2022 SakarKoot 245 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.