1,416 views
1 votes
1 votes
does graph based and time stamp ordering protocol ensure freedom from cascadeless rollback?

1 Answer

Best answer
3 votes
3 votes

Graph based protocol :

the abort of a transaction can  lead to cascading rollbacks

Time stamp ordering protocol:

  • Problem with timestamp-ordering protocol:
    • suppose Tj read data item written by Ti
    • if Ti is aborted, then Tj must abort
    • further, any transaction that has read a data item written by Ti must abort
    • This can lead to cascading rollback --- that is, a chain of rollbacks

Both suffers from Cascading rollbacks.

ref : http://codex.cs.yale.edu/avi/db-book/db4/slide-dir/ch16-2.pdf

https://gateoverflow.in/49349/locking-protocol

http://ggn.dronacharya.info/Mtech_CSE/Downloads/QuestionBank/ISem/Advanced_Database_Management_System/unit-2/Lec5.pdf

selected by

Related questions

1 votes
1 votes
1 answer
1
aditi19 asked Dec 1, 2018
1,933 views
there is a schedule which is allowed in Thomas write rule so it is view serializable. Suppose at a point write operation of an older transaction is ignored. then the same...
1 votes
1 votes
1 answer
2
Shivam Gupta 3 asked Aug 3, 2017
633 views
T1: r1(x)w1(x)r1(y)w1(y)T2: r2(y)w2(y)L is xclusive lock and U is unlock L1(y)L1(X)R1(Y)W1(Y)R1(X)W1(X)U1(X)U1(Y)L2(Y)R2(Y)W2(Y)U2(Y)?IS THIS SCHEDULE VALID UNDER A 2 PH...