Register

Recent questions tagged transaction-and-concurrency

4 votes
1 answer
301
DBMS Number of serializable schedules
Consider thw following transactions:- T1 :- r1(A) w1(A) r1(B) w1(B) T1 :- r2(A) w2(A) r2(B) w2(B) a) Number of schedules serializable as t1->t2? b) Number of schedules serializable as t2->t1?
Consider thw following transactions:-T1 :- r1(A) w1(A) r1(B) w1(B)T1 :- r2(A) w2(A) r2(B) w2(B)a) Number of schedules serializable as t1->t2?b) Number of schedules serial...
User Avatar
11 votes
3 answers
302
[DBMS] Number of view equal schedules
Number of schedules view equal to following schedule :- r1(A), w1(B), r2(A), w2(B), r3(A), w3(B)
Number of schedules view equal to following schedule :- r1(A), w1(B), r2(A), w2(B), r3(A), w3(B)
User Avatar
0 votes
1 answer
303
Ramakrishan
In some part, it is given we cannot decide, why we cannot decide view serializability and recoverability? And, explain the solution for 7th part.
In some part, it is given we cannot decide, why we cannot decide view serializability and recoverability?And, explain the solution for 7th part.
User Avatar
11 votes
3 answers
304
ISRO2017-6
ACID properties of a transactions are Atomicity, consistency, isolation, database Atomicity, consistency, isolation, durability Atomicity, consistency, integrity, durability Atomicity, consistency, integrity, database
ACID properties of a transactions areAtomicity, consistency, isolation, databaseAtomicity, consistency, isolation, durabilityAtomicity, consistency, integrity, durability...
User Avatar
5 votes
3 answers
305
ISRO 2017-5
Which of the following concurrency control protocol ensures both conflict and free from deadlock? , Time stamp ordering 2 Phase locking Both (a) and (b) None of the above
Which of the following concurrency control protocol ensures both conflict and free from deadlock? ,Time stamp ordering2 Phase lockingBoth (a) and (b)None of the above
User Avatar
1 votes
1 answer
307
Pessimistic time stamp ordering vs optimistic time stamp ordering
What is the difference between Pessimistic time stamp ordering and optimistic time stamp ordering.
What is the difference between Pessimistic time stamp ordering and optimistic time stamp ordering.
User Avatar
0 votes
0 answers
309
Doubt in two phase Commit Protocol
In two phase Commit Protocol,why can blocking be completely eliminated even when participants elect a new Coordinator ?
In two phase Commit Protocol,why can blocking be completely eliminated even when participants elect a new Coordinator ?
User Avatar
1 votes
2 answers
315
concurrency control
IS CONSERVATIVE 2PL ALSO RIGOROUS?? WHEN WE SAY THAT A TRANSACTION FOLLOWS CONSERVATIVE TWO PHASE LOCKING, DOES IT AUTOMATICALLY ALSO IMPLY RIGOROUS 2PL??
IS CONSERVATIVE 2PL ALSO RIGOROUS?? WHEN WE SAY THAT A TRANSACTION FOLLOWS CONSERVATIVE TWO PHASE LOCKING, DOES IT AUTOMATICALLY ALSO IMPLY RIGOROUS 2PL??
User Avatar
1 votes
3 answers
317
MadeEasy Subject Test: Databases - Transactions
S: R1(A), R3(D), W1(B), R2(B), R4(B), W2(C), R5(C), W4(E), R5(E), W5(B) Number of serial schedules which are view equal to above S are __. Polygraph that I drew:
S: R1(A), R3(D), W1(B), R2(B), R4(B), W2(C), R5(C), W4(E), R5(E), W5(B)Number of serial schedules which are view equal to above S are __.Polygraph that I drew:
User Avatar
1 votes
2 answers
318
Ace Test Series: Databases - Transactions
Whether the given schedule is conflict serializable or view serializable or none.
Whether the given schedule is conflict serializable or view serializable or none.
User Avatar
7 votes
3 answers
319
view serializable
$S: R_1(A),R_2(B),W_2(A),W_3(C),R_4(C),R_3(A),W_3(B),R_4(A),W_2(B),W_4(B),W_3(A)$ View serializable or not?
$S: R_1(A),R_2(B),W_2(A),W_3(C),R_4(C),R_3(A),W_3(B),R_4(A),W_2(B),W_4(B),W_3(A)$View serializable or not?
User Avatar
1 votes
1 answer
320
Self Doubt
Do commit operations matter while checking serilizability?If yes why?
Do commit operations matter while checking serilizability?If yes why?
User Avatar
0 votes
1 answer
322
MadeEasy Subject Test: Databases - Transactions
Here T1 T2 T4 T5 will come in this order only and for T3 we have 5 positions So number of schedules will be 5 which are view eq to given schedule. But ans given is 10
Here T1 T2 T4 T5 will come in this order only and for T3 we have 5 positionsSo number of schedules will be 5 which are view eq to given schedule.But ans given is 10
User Avatar
1 votes
1 answer
324
MadeEasy Subject Test: Databases - Transactions
Consider the following schedule S : r1(A) w2(A) r3(A) w4(A) r5(A) w6(A) The number of schedules equal to given schedule(s) which not conflict equal to schedule(s) are _______.
Consider the following scheduleS : r1(A) w2(A) r3(A) w4(A) r5(A) w6(A)The number of schedules equal to given schedule(s) which not conflict equal toschedule(s) are ______...
User Avatar
1 votes
4 answers
326
Conflict Serializable and Timestamp based protocol
I know that every schedule produced by the Timestamp-based protocol is conflict serializable. But is vice versa is true? Means is all conflict serializable schedules produced by timestamp based protocol ?
I know that every schedule produced by the Timestamp-based protocol is conflict serializable. But is vice versa is true? Means is all conflict serializable schedules prod...
User Avatar
Page: