Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged transaction-and-concurrency
8
votes
2
answers
331
Test by Bikram | Mock GATE | Test 1 | Question: 8
Consider the schedule given below. $T_1$ and $T_2$ are two transactions operating on two resources $x$ and $y.$ ... The given schedule is A serializable schedule A non-serializable schedule A dead lock situation Both non-serializable and deadlock schedule
Consider the schedule given below. $T_1$ and $T_2$ are two transactions operating on two resources $x$ and $y.$$$\begin{array}{|c|c|c|} \hline \bf{T_1} & \bf{T_2} \\ \hli...
Bikram
1.2k
views
Bikram
asked
Jan 16, 2017
Databases
tbb-mockgate-1
transaction-and-concurrency
databases
+
–
2
votes
2
answers
332
MadeEasy Test Series
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 to schedule(s) are _____...
vnc
1.1k
views
vnc
asked
Jan 10, 2017
Databases
databases
transaction-and-concurrency
+
–
0
votes
1
answer
333
MadeEasy Subject Test: Databases - Transactions
Consider the following schedule : S::r1(A),r3(D),w1(B),r2(B),r4(B),w2(C),r5(C),w4(E),r5(E),w5(B) The number of serial schedules which are view equal to schedule (S) ___________.
Consider the following schedule :S::r1(A),r3(D),w1(B),r2(B),r4(B),w2(C),r5(C),w4(E),r5(E),w5(B)The number of serial schedules which are view equal to schedule (S) _______...
vnc
374
views
vnc
asked
Jan 10, 2017
Databases
databases
made-easy-test-series
transaction-and-concurrency
+
–
0
votes
0
answers
334
MadeEasy Subject Test: Databases - Transactions
T2 is doing one blind write and it is recoverable,so why c is not correct? I agree though that b is also correct.Please help
T2 is doing one blind write and it is recoverable,so why c is not correct?I agree though that b is also correct.Please help
rahul sharma 5
243
views
rahul sharma 5
asked
Jan 10, 2017
Databases
made-easy-test-series
databases
transaction-and-concurrency
+
–
0
votes
1
answer
335
MadeEasy Subject Test: Databases - Transactions
How to solve this??
How to solve this??
Lucky sunda
496
views
Lucky sunda
asked
Jan 9, 2017
Databases
made-easy-test-series
databases
transaction-and-concurrency
+
–
0
votes
3
answers
336
[DBMS Schedules] Lost update vs ww conflict
W1(A),R2(A),W2(A),W2(B),W1(B) This schedule has WW conflict but not Lost update problem,Please explain why? Is it possible to have WW conflict without lost update?
W1(A),R2(A),W2(A),W2(B),W1(B)This schedule has WW conflict but not Lost update problem,Please explain why?Is it possible to have WW conflict without lost update?
rahul sharma 5
2.2k
views
rahul sharma 5
asked
Jan 7, 2017
Databases
databases
transaction-and-concurrency
conflict-serializable
+
–
0
votes
1
answer
337
MadeEasy Subject Test: Databases - Transactions
Akanksha Kesarwani
335
views
Akanksha Kesarwani
asked
Jan 5, 2017
Databases
databases
made-easy-test-series
transaction-and-concurrency
+
–
0
votes
1
answer
338
Ace Test Series: Databases - Time Stamp Ordering
chaser
586
views
chaser
asked
Dec 30, 2016
Databases
ace-test-series
databases
transaction-and-concurrency
time-stamp-ordering-protocol
+
–
2
votes
0
answers
339
Determining Strict 2PL
Which of the following schedules are allowed by strict 2pl with shared and xclusive locks - r1(A); r2(B); r3(C); w1(B); c1; w2(C); c2; w3(D); c3 r1(A); r2(B); r3(C); r1(B); r2(C); r3(D); c3; ... and strict recoverability and both must be satisfied. In the above 1) and 2) satisfy conflict serializablility and strict recoverability. Then which is the correct solution?
Which of the following schedules are allowed by strict 2pl with shared and xclusive locks -r1(A); r2(B); r3(C); w1(B); c1; w2(C); c2; w3(D); c3r1(A); r2(B); r3(C); r1(B);...
yg92
752
views
yg92
asked
Dec 26, 2016
Databases
transaction-and-concurrency
databases
+
–
1
votes
0
answers
340
view serializable
S1: R(A) W(A) W(B) S2: R(A) W(A) R(B) W(B) How many view serializable schedules are possible which are not conflict serializable? (A) 0 (B) 1 (C) 2 (D) 3
S1: R(A) W(A) W(B)S2: R(A) W(A) R(B) W(B)How many view serializable schedules are possible which are not conflict serializable?(A) 0(B) 1(C) 2(D) 3
indrajeet
489
views
indrajeet
asked
Dec 25, 2016
Databases
databases
transaction-and-concurrency
view-serializable
+
–
5
votes
1
answer
341
Schedule's
$1)$ Consider schedule below. Determine whether schedule is cascadeless or not ? r1(x); r2(z); r1(z); r3(x); r3(y); w1(x); c1; w3(y); c3; r2(y); w2(z); w2(y);c2
$1)$ Consider schedule below. Determine whether schedule is cascadeless or not ?r1(x); r2(z); r1(z); r3(x); r3(y); w1(x); c1; w3(y); c3; r2(y); w2(z); w2(y);c2
Prabhanjan_1
1.2k
views
Prabhanjan_1
asked
Dec 24, 2016
Databases
databases
transaction-and-concurrency
+
–
6
votes
3
answers
342
Schedules
$1)$ Find the number of all possible conflict-equivalent and view-equivalent schedules to the following serial schedules. (a) r1(A), w1(B), r2(A), w2(B), r3(A), w3(B).
$1)$ Find the number of all possible conflict-equivalent and view-equivalent schedules to the following serial schedules. (a) r1(A), w1(B), r2(A), w2(B), r3(A), w3(B)....
Prabhanjan_1
4.9k
views
Prabhanjan_1
asked
Dec 24, 2016
Databases
transaction-and-concurrency
conflict-serializable
view-serializable
+
–
2
votes
1
answer
343
ACE TEST SERIES:-Transaction 2pl and Time stamp based protocol
KISHALAY DAS
713
views
KISHALAY DAS
asked
Dec 22, 2016
Databases
databases
transaction-and-concurrency
conflict-serializable
test-series
+
–
2
votes
4
answers
344
ME-FST6:Transaction,Recoverability and 2PL
KISHALAY DAS
3.0k
views
KISHALAY DAS
asked
Dec 21, 2016
Databases
transaction-and-concurrency
databases
concurrency
conflict-serializable
+
–
4
votes
2
answers
345
#dbms #transaction
Consider the 2 transactions T1 and T2 and four schedules S1, S2, S3 and S4 of T1 and T2 are given below: T1: R1[X] W1[X] W1[Y] T2: R2[X] R2[Y] W2[Y] S1: R1[X] R2[X] R2[Y] W1[X] W1[Y] W2[Y] S2: R1[X] R2[X] R2[Y] W1[X] W2[Y] W1[Y] S3: R1[ ... R2[Y] R1[X] W1[X] W1[Y] W2[Y] Which of the following schedules are conflict serializable? (a) S1 and S2 (b) S2 and S3 (c) S3 only (d) S4 only
Consider the 2 transactions T1 and T2 and four schedules S1, S2, S3 and S4 of T1 and T2 aregiven below:T1: R1[X] W1[X] W1[Y]T2: R2[X] R2[Y] W2[Y]S1: R1[X] R2[X] R2[Y] W1[...
shefali1
2.7k
views
shefali1
asked
Dec 10, 2016
Databases
databases
transaction-and-concurrency
conflict-serializable
+
–
0
votes
2
answers
346
Transactions
Neal Caffery
415
views
Neal Caffery
asked
Dec 8, 2016
Databases
transaction-and-concurrency
databases
+
–
0
votes
1
answer
347
MadeEasy Test Series: Databases - Transactions
#plz check i am right ??
#plz check i am right ??
Hradesh patel
450
views
Hradesh patel
asked
Dec 6, 2016
Databases
made-easy-test-series
databases
transaction-and-concurrency
+
–
0
votes
1
answer
348
2Phase locking question.
Which of the following 2PL schemes guarantee conflict serializability? Basic 2PL Conservative 2PL Strict 2PL Rigorous 2PL
Which of the following 2PL schemes guarantee conflict serializability?Basic 2PLConservative 2PLStrict 2PLRigorous 2PL
Aghori
994
views
Aghori
asked
Dec 3, 2016
Databases
transaction-and-concurrency
concurrency
+
–
5
votes
2
answers
349
Virtual Gate Test Series: Databases - Recover Schedule
Assume there are n transactions$:T_{1},T_{2},.,T_{n}.$ Every transaction writes value of $X$ that is read by its successive transaction like $T_{1}$ writes value of $X$ that is read by $T_{2}, T_{2}$ writes a value of ... $X$ that is read by Tn. Now,if $T_{1}$ fails,then total how many transaction rollbacks are required to recover the schedule?
Assume there are n transactions$:T_{1},T_{2},.,T_{n}.$ Every transaction writes value of $X$ that is read by its successive transaction like $T_{1}$ writes value of $X$ t...
smartmeet
981
views
smartmeet
asked
Nov 30, 2016
Databases
databases
transaction-and-concurrency
virtual-gate-test-series
+
–
6
votes
2
answers
350
What is "Strict recoverable" schedule?
Consider the following schedule: $S: r_1(A), w_2(A), Commit_2, w_1(A),w_3(A), Commit_3, Commit_1$ Which of the following is true? a. Schedule is view serializable schedule and strict recoverable schedule b. Schedule is ... know what is "strict schedule" and "recoverable schedule", But then what it means by "strict recoverable"?
Consider the following schedule:$S: r_1(A), w_2(A), Commit_2, w_1(A),w_3(A), Commit_3, Commit_1$Which of the following is true?a. Schedule is view serializable schedule a...
GateAspirant999
6.7k
views
GateAspirant999
asked
Nov 6, 2016
Unknown Category
concurrency
databases
transaction-and-concurrency
+
–
3
votes
3
answers
351
What equates to definition of irrecoverable schedule?
Which of the following is correct? a. A schedule will be irrecoverable if a transaction reads a data item and commit after it is written by an uncommitted transaction. b. A schedule will be irrecoverable if a transaction writes a data ... given options are not making me any sense in order to relate them to above definition. Whats going on here?
Which of the following is correct?a. A schedule will be irrecoverable if a transaction reads a data item and commit after it is written by an uncommitted transaction.b. A...
GateAspirant999
2.1k
views
GateAspirant999
asked
Nov 5, 2016
Databases
transaction-and-concurrency
+
–
2
votes
3
answers
352
Kerala PSC AP Exam
Amongst the ACID property of a transaction, the durability property requires that the changes made to the database by a success full transaction persist A) except in case of an operating system crash B) except in case of a disk crash C) except in case of power failure D) always, even if there is a failure of any kind
Amongst the ACID property of a transaction, the durability property requires that the changes made to the database by a success full transaction persistA) except in case ...
Sankaranarayanan P.N
382
views
Sankaranarayanan P.N
asked
Oct 27, 2016
Databases
transaction-and-concurrency
+
–
3
votes
2
answers
353
Concurrency Strict Schedule
Consider the following database schedule with two transactions T1T1 and T2T2. S=r2(X);r1(X);r2(Y);w1(X);r1(Y);a1;a2 where a1 and a2 stands for abort. Is It a strict schedule? Please explain why or why not?
Consider the following database schedule with two transactions T1T1 and T2T2.S=r2(X);r1(X);r2(Y);w1(X);r1(Y);a1;a2 where a1 and a2 stands for abort. Is It a strict sched...
Tendua
647
views
Tendua
asked
Oct 26, 2016
Databases
databases
concurrency
transaction-and-concurrency
+
–
1
votes
1
answer
354
Conflict + View + Concurrency
Do they all ensure serializability??? Strict 2PL Rigirous 2PL Conservative 2PL Multiversion 2PL Timestamp Stirct timestamp Multiversion timestamp Graph based protocol Thomas write rule Multiple granuality And among them which policy allows schedules that are not conflict serializable by are view serializable???
Do they all ensure serializability???Strict 2PLRigirous 2PLConservative 2PLMultiversion 2PLTimestampStirct timestampMultiversion timestampGraph based protocolThomas write...
Rahul Jain25
576
views
Rahul Jain25
asked
Oct 22, 2016
Databases
view-serializable
conflict-serializable
transaction-and-concurrency
databases
concurrency
+
–
3
votes
1
answer
355
#dbms #serializability
There exist an schedule which serializable but is neither view serializable nor conflict serializable ?
There exist an schedule which serializable but is neither view serializable nor conflict serializable ?
Tesla!
3.3k
views
Tesla!
asked
Oct 11, 2016
Databases
databases
transaction-and-concurrency
+
–
11
votes
2
answers
356
serializablity and recoverability of schedules
1) T1: R(X), T2: W(X), T1: W(X), T2: Abort, T1: Commit 2) T1: W(X), T2: R(X), T1: W(X), T2: Abort, T1: Commit 3) T1: W(X), T2: R(X), T1: W(X), T2: ... : Abort Can anyone explain whether these schedules are serializable, conflict-serializable, view serializable, recoverable, avoids-cascading-aborts, and strict? The abort operation actually bugging me.
1) T1: R(X), T2: W(X), T1: W(X), T2: Abort, T1: Commit2) T1: W(X), T2: R(X), T1: W(X), T2: Abort, T1: Commit3) T1: W(X), T2: R(X), T1: W(X), T2: Commit, T1: AbortCan anyo...
vix28
12.0k
views
vix28
asked
Sep 8, 2016
Databases
transaction-and-concurrency
concurrency
conflict-serializable
view-serializable
databases
+
–
0
votes
2
answers
357
UGC NET CSE | December 2010 | Part 2 | Question: 18
Which of the following is an optimistic concurrency control method ? Validation based Time stamp ordering Lock-based None of these
Which of the following is an optimistic concurrency control method ?Validation basedTime stamp orderingLock-basedNone of these
makhdoom ghaya
4.3k
views
makhdoom ghaya
asked
Sep 7, 2016
Databases
ugcnetcse-dec2010-paper2
databases
transaction-and-concurrency
+
–
2
votes
1
answer
358
#View Serializability #DBMS
I know that this is Conflict serializable and i know all schedules which are Conflict serializable are also view serializable But still wanted to know what is the view serializable sequence?
I know that this is Conflict serializable and i know all schedules which are Conflict serializable are also view serializableBut still wanted to know what is the view ser...
Prajwal Bhat
970
views
Prajwal Bhat
asked
Sep 5, 2016
Databases
view-serializable
databases
transaction-and-concurrency
+
–
3
votes
2
answers
359
UGC NET CSE | June 2011 | Part 2 | Question: 19
A transaction can include following basic database access operations : Read_item(X) Write_item(X) Both (A) and (B) None of these
A transaction can include following basic database access operations :Read_item(X)Write_item(X)Both (A) and (B)None of these
makhdoom ghaya
1.5k
views
makhdoom ghaya
asked
Aug 23, 2016
Others
ugcnetcse-june2011-paper2
databases
transaction-and-concurrency
+
–
2
votes
2
answers
360
UGC NET CSE | June 2011 | Part 2 | Question: 18
The basic variants of time-stampbased method of concurrency control are Total time stamp-ordering Partial time stamp ordering Multiversion Time stamp ordering All of the above
The basic variants of time-stampbased method of concurrency control areTotal time stamp-orderingPartial time stamp orderingMultiversion Time stamp orderingAll of the abov...
makhdoom ghaya
1.2k
views
makhdoom ghaya
asked
Aug 23, 2016
Others
ugcnetcse-june2011-paper2
databases
transaction-and-concurrency
+
–
Page:
« prev
1
...
7
8
9
10
11
12
13
14
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register