Register

dbms, concurrency control

855 views
1 1 vote
Can a schedule ( s) be irrecoverable and conflict serializable at same time?

1 Answer

2 2 votes

for irrecoverable schedule there should be a dirty read and transaction who is reading commits first than transaction who wrote . while in case of conflict serializable schedule there should be not any cyclic conflicting relationship.

consider  an example given below

Voting & Accepting an answer helps improve the community
← Previous · Candidate keyNext → · gate-98 question
← Previous in category · Candidate keyNext in category → · RELATIONAL ALGEBRA
Position:
Show:

Related questions

2 2 votes
0 0 answers
2.0k
2.0k views
hacker16 asked Jan 18, 2018
1,983 views
Concurrency Control
Which of the following statement is true?1. time stamp protocol may not result recoverable schedule2. in 2PL, No data are affected until all locks are obtained i.e., unti...
1 1 vote
3 3 answers
3.0k
3.0k views
Ml_Nlp asked Apr 17, 2017
2,988 views
Concurrency Control
Consider the following schedules:S1: W2(x), W1(x), R3(x), R1(x), W2(y), R3(y), R3(z), R2(x)S2: R3(z), W2(x), W2(y), R1(x), R3(x), R2(z), R3(y), W1(x)S3...
1 1 vote
1 1 answer
877
877 views
Rahul Jain25 asked Oct 22, 2016
877 views
Conflict + View + Concurrency
Do they all ensure serializability???Strict 2PLRigirous 2PLConservative 2PLMultiversion 2PLTimestampStirct timestampMultiversion timestampGraph based protocolThomas write...
0 0 votes
0 0 answers
676
676 views
jayadev asked Jul 2, 2022
676 views
concurrency control
question about concurrency control methods