The Gateway to Computer Science Excellence
+1 vote
81 views

Consider the following schedule:

S: r2(A), w1(B), w1(C), r3(B), r2(B), r1(A), C1, r2(C), C2, w3(A), C3

Which of the following are true? 

A) S is conflict serializabile

B) S is allowed by 2PL

C) S is strict recoverable 

D) S is allowed by strict 2PL

  • 🚩 Duplicate | 👮 smsubham | 💬 “https://gateoverflow.in/297550/madeeasy-test-series-2019-databases-transaction-concurrency”
in Databases by (117 points) 1 flag
edited by | 81 views

1 Answer

0 votes
Is answer (A)?
by (153 points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,833 questions
57,727 answers
199,451 comments
107,856 users