1,948 views

2 Answers

2 votes
2 votes
There is no relationship between recoverability and serializability.

Just consider this example:

T1                   T2

W(A)

                    R(A)

                   commit

commit

This is conflict seralizable but not recoverable.
0 votes
0 votes

A schedule S is serial if, for every transaction T participating in the schedule, all the operations of T are executed consecutively in the schedule; otherwise, the schedule is called non-serial. Therefore, in a serial schedule, only one transaction at a time is active—the commit (or abort) of the active transaction initiates execution of the next transaction.

As only one transaction is active it is always recoverable.

Related questions

2 votes
2 votes
0 answers
2
1 votes
1 votes
1 answer
4
budhu asked Jan 29, 2018
1,507 views
The given schedule:R1 (A) R2 (B) W2 (B) W1(A) W2 (A) Commit2 R1 (C)is revoreable, cascadeless or strict?