retagged by
583 views
1 votes
1 votes
Do they all ensure serializability???

Strict 2PL

Rigirous 2PL

Conservative 2PL

Multiversion 2PL

Timestamp

Stirct timestamp

Multiversion timestamp

Graph based protocol

Thomas write rule

Multiple granuality

And among them which policy allows schedules that are not conflict serializable by are view serializable???
retagged by

1 Answer

1 votes
1 votes
Strict 2PL

Rigirous 2PL

Conservative 2PL

Multiversion 2PL

Timestamp

Stirct timestamp

Multiversion timestamp

Graph based protocol

These ensure conflict serializibility

Thomas write rule doesn't

Related questions

3 votes
3 votes
3 answers
4
shivangi5 asked Dec 6, 2017
2,970 views
Consider the 2 transactionsT1: R(A) W(A) W(B)T2: R(A) W(A) R(B) W(B)How many view serializable schedules are possible which are not conflict serializable?(A) 0(B) 1(C) 2(...