Register

Conflict + View + Concurrency

• retagged by
866 views
1 1 vote
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???

1 Answer

1 1 vote
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
Voting & Accepting an answer helps improve the community
← Previous · mathematicsNext → · countability
← Previous in category · #b-tree #DBMSNext in category → · Block Nested Loop Jo...
Position:
Show:

Related questions

3 3 votes
1 1 answer
2.1k
2.1k views
Parshu gate asked Dec 5, 2017
2,083 views
Conflict and View serializable
10 10 votes
1 answers 1 answer
5.1k
5.1k views
flow2539 asked May 28, 2018
5,148 views
Are aborted transactions ALWAYS ignored when determining result/view/conflict serializability?
I am looking for some clarity on this topic. Here is some random schedule as an example:$r1(x) w1(x) r2(x) w2(x) r3(y) r3(x) w3(x) c3 a1 c2$I was told, that for conflict...
1 1 vote
1 1 answer
527
527 views
js__ asked Sep 7, 2025
527 views
Database
S : r1(A) r3(D) w1(B)​ r2(B) w3(B) r4(B) w2(C) r5(C) w4(E) r5(E) w5(B)How many serial schedule view equal to schedule (s)
11 11 votes
2 answers 2 answers
17.7k
17.7k views
vix28 asked Sep 8, 2016
17,677 views
serializablity and recoverability of schedules
1) T1: R(X), T2: W(X), T1: W(X), T2: Abort, T1: Commit2) T1: W(X), T2: R(X), T1: W(X), T2: Abort, T1: Commit3) T1: W(X), T2: R(X), T1: W(X), T2: Commit, T1: AbortCan anyo...