Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
SakarKoot
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by SakarKoot
0
answers
1
Serializability
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 ?
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 ?
228
views
asked
Sep 4, 2022
Databases
transactions-and-concurrency-control
conflict-serializable
view-serializable
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register