Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged transaction-and-concurrency
2
votes
2
answers
361
UGC NET CSE | June 2011 | Part 2 | Question: 16
Which of the following is the recovery management technique in DDBMS ? 2PC (Two Phase Commit) Backup Immediate update All of the above
Which of the following is the recovery management technique in DDBMS ?2PC (Two Phase Commit)BackupImmediate updateAll of the above
makhdoom ghaya
2.8k
views
makhdoom ghaya
asked
Aug 23, 2016
Others
ugcnetcse-june2011-paper2
databases
transaction-and-concurrency
+
–
3
votes
2
answers
362
UGC NET CSE | Junet 2015 | Part 2 | Question: 37
Let $P-i$ and $P_j$ two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two processes $p_i$ and $P_j$ which of the conditions are not true? $R(P_i) \cap W(P_j) = \Phi$ $W(P_i) \cap R(P_j) = \Phi$ $R(P_i) \cap R(P_j) = \Phi$ $W(P_i) \cap W(P_j) = \Phi$
Let $P-i$ and $P_j$ two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two proces...
go_editor
2.9k
views
go_editor
asked
Jul 30, 2016
Operating System
ugcnetcse-june2015-paper2
transaction-and-concurrency
+
–
2
votes
1
answer
363
UGC NET CSE | December 2014 | Part 3 | Question: 09
_________ rules used to limit the volume of log information that has to be handled and processed in the event of system failure involving the loss of volatile information. Write-ahead log Check-pointing Log buffer Thomas
_________ rules used to limit the volume of log information that has to be handled and processed in the event of system failure involving the loss of volatile information...
makhdoom ghaya
3.1k
views
makhdoom ghaya
asked
Jul 24, 2016
Databases
ugcnetcse-dec2014-paper3
databases
transaction-and-concurrency
recovery-from-failure
+
–
4
votes
1
answer
364
UGC NET CSE | December 2014 | Part 3 | Question: 08
Which of the following is correct ? I. Two phase locking is an optimistic protocol. II. Two phase locking is pessimistic protocol III. Time stamping is an optimistic protocol. IV. Time stamping is pessimistic protocol. $I$ and $III$ $II$ and $IV$ $I$ and $IV$ $II$ and $III$
Which of the following is correct ?I. Two phase locking is an optimistic protocol.II. Two phase locking is pessimistic protocolIII. Time stamping is an optimistic protoco...
makhdoom ghaya
4.0k
views
makhdoom ghaya
asked
Jul 24, 2016
Databases
ugcnetcse-dec2014-paper3
databases
transaction-and-concurrency
+
–
1
votes
2
answers
365
UGC NET CSE | September 2013 | Part 2 | Question: 43
Thoma’s-write rule is Two phase locking protocol Timestamp ordering protocol One phase locking protocol Sliding window protocol
Thoma’s-write rule isTwo phase locking protocolTimestamp ordering protocolOne phase locking protocolSliding window protocol
go_editor
1.5k
views
go_editor
asked
Jul 21, 2016
Databases
ugcnetsep2013ii
databases
transaction-and-concurrency
+
–
1
votes
1
answer
366
UGC NET CSE | September 2013 | Part 2 | Question: 37
Usage of Preemption and Transaction Rollback prevents _____. Unauthorized usage of data file Deadlock situation Data manipulation File pre-emption
Usage of Preemption and Transaction Rollback prevents _____.Unauthorized usage of data fileDeadlock situationData manipulationFile pre-emption
go_editor
1.8k
views
go_editor
asked
Jul 21, 2016
Databases
ugcnetsep2013ii
databases
transaction-and-concurrency
+
–
5
votes
1
answer
367
ISRO2016-58
Trigger is Statement that enables to start any DBMS Statement that is executed by the user when debugging an application program The condition that the system tests for the validity of the database user Statement that is executed automatically by the system as a side effect of a modification of the database
Trigger isStatement that enables to start any DBMSStatement that is executed by the user when debugging an application programThe condition that the system tests for the ...
go_editor
5.2k
views
go_editor
asked
Jul 6, 2016
Databases
isro2016
databases
transaction-and-concurrency
+
–
0
votes
1
answer
368
UGC NET CSE | June 2012 | Part 2 | Question: 12
A Transaction Manager is which of the following? Maintains a log of transactions Maintains before and after database images Maintains appropriate concurrent control All of the above
A Transaction Manager is which of the following?Maintains a log of transactionsMaintains before and after database imagesMaintains appropriate concurrent controlAll of th...
go_editor
2.2k
views
go_editor
asked
Jul 4, 2016
Databases
ugcnetcse-june2012-paper2
databases
transaction-and-concurrency
+
–
3
votes
2
answers
369
Can someone please explain the steps to check view serializability using polygraph method ?
Can someone please explain the steps to check view serializability using polygraph method ? I am really having trouble in understanding it.
Can someone please explain the steps to check view serializability using polygraph method ? I am really having trouble in understanding it.
Aakash Das
931
views
Aakash Das
asked
Jun 22, 2016
Databases
view-serializable
databases
transaction-and-concurrency
+
–
12
votes
4
answers
370
ISRO2011-15
What is the equivalent serial schedule for the following transactions? $\text{T}_1 - \text{T}_2 - \text{T}_3$ $\text{T}_3 - \text{T}_1 - \text{T}_2$ $\text{T}_2 - \text{T}_1 - \text{T}_3$ $\text{T}_1 - \text{T}_3 - \text{T}_2$
What is the equivalent serial schedule for the following transactions? $\text{T}_1 - \text{T}_2 - \text{T}_3$$\text{T}_3 - \text{T}_1 - \text{T}_2$$\text{T}_2 - \text{T}_...
go_editor
4.7k
views
go_editor
asked
Jun 21, 2016
Databases
isro2011
databases
transaction-and-concurrency
+
–
5
votes
2
answers
371
ISRO2009-71
Which of the following contains complete record of all activity that affected the contents of a database during a certain period of time? Transaction log Query language Report writer Data manipulation language
Which of the following contains complete record of all activity that affected the contents of a database during a certain period of time?Transaction logQuery languageRepo...
go_editor
5.6k
views
go_editor
asked
Jun 15, 2016
Databases
isro2009
databases
transaction-and-concurrency
+
–
5
votes
3
answers
372
ISRO2007-60
Which of the following is correct with respect to Two phase commit protocol? Ensures serializability Prevents Deadlock Detects Deadlock Recover from Deadlock
Which of the following is correct with respect to Two phase commit protocol?Ensures serializabilityPrevents DeadlockDetects DeadlockRecover from Deadlock
go_editor
7.4k
views
go_editor
asked
Jun 10, 2016
Databases
isro2007
databases
transaction-and-concurrency
+
–
1
votes
1
answer
373
Concurrency Control (View Serializability)
Read(Q) Write(Q) Write(Q) Is this schedule View serializable???? in <T1,T2> it violates the final Write criteria in <T2,T1> does it violate initial Read criteria?
Read(Q) Write(Q) Write(Q)Is this schedule View serializable?...
namanom1
706
views
namanom1
asked
May 15, 2016
Databases
view-serializable
databases
transaction-and-concurrency
+
–
5
votes
3
answers
374
ISRO-2013-23
Which of the following is the highest isolation level in transaction management? Serializable Repeated Read Committed Read Uncommitted Read
Which of the following is the highest isolation level in transaction management?SerializableRepeated ReadCommitted ReadUncommitted Read
makhdoom ghaya
7.1k
views
makhdoom ghaya
asked
Apr 26, 2016
Databases
isro2013
transaction-and-concurrency
+
–
64
votes
4
answers
375
GATE CSE 2016 Set 1 | Question: 51
Consider the following two phase locking protocol. Suppose a transaction $T$ accesses (for read or write operations), a certain set of objects $\{O_1,\ldots,O_k \}$. This is done in the following ... freedom guarantee neither serializability nor deadlock-freedom guarantee serializability but not deadlock-freedom guarantee deadlock-freedom but not serializability.
Consider the following two phase locking protocol. Suppose a transaction $T$ accesses (for read or write operations), a certain set of objects $\{O_1,\ldots,O_k \}$. This...
Sandeep Singh
21.3k
views
Sandeep Singh
asked
Feb 12, 2016
Databases
gatecse-2016-set1
databases
transaction-and-concurrency
normal
+
–
23
votes
2
answers
376
GATE CSE 2016 Set 1 | Question: 22
Which one of the following is NOT a part of the ACID properties of database transactions? Atomicity Consistency Isolation Deadlock-freedom
Which one of the following is NOT a part of the ACID properties of database transactions?AtomicityConsistencyIsolationDeadlock-freedom
Sandeep Singh
10.0k
views
Sandeep Singh
asked
Feb 12, 2016
Databases
gatecse-2016-set1
databases
transaction-and-concurrency
easy
+
–
64
votes
6
answers
377
GATE CSE 2016 Set 2 | Question: 51
Consider the following database schedule with two transactions $T_{1}$ and $T_{2}$ ... is TRUE? $S$ is non-recoverable. $S$ is recoverable, but has a cascading abort. $S$ does not have a cascading abort. $S$ is strict.
Consider the following database schedule with two transactions $T_{1}$ and $T_{2}$.$S= r_{2}\left(X\right); r_{1}\left(X\right); r_{2} \left(Y\right); w_{1} \left(X\right...
Akash Kanase
21.9k
views
Akash Kanase
asked
Feb 12, 2016
Databases
gatecse-2016-set2
databases
transaction-and-concurrency
normal
+
–
34
votes
6
answers
378
GATE CSE 2016 Set 2 | Question: 22
Suppose a database schedule $S$ involves transactions $T_1,\ldots,T_n$ . Construct the precedence graph of $S$ with vertices representing the transactions and edges representing the conflicts. If $S$ is serializable, which one of ... to yield a serial schedule? Topological order Depth-first order Breadth-first order Ascending order of the transaction indices
Suppose a database schedule $S$ involves transactions $T_1,\ldots,T_n$ . Construct the precedence graph of $S$ with vertices representing the transactions and edges repr...
Akash Kanase
13.0k
views
Akash Kanase
asked
Feb 12, 2016
Databases
gatecse-2016-set2
databases
transaction-and-concurrency
normal
+
–
0
votes
2
answers
379
View serializable
S: T1(A)R2(B)W2(B)R2(A)W2(B)W1(A)R3(B)W3(B) Given schedule is view serializable ?
S: T1(A)R2(B)W2(B)R2(A)W2(B)W1(A)R3(B)W3(B) Given schedule is view serializable ?
Bishnu Agrawal
746
views
Bishnu Agrawal
asked
Feb 1, 2016
Databases
view-serializable
databases
transaction-and-concurrency
+
–
2
votes
1
answer
380
transactions
schedule R(A) R(B) R(B) W(A) COMMIT R(C) R(B) W(C) W(B) R(A) R(C) COMMIT COMMIT The above scedule is -: a)conflict serializable b)recoverable c)cascadeless d)all of these according to me a)&b) answer given -:a)
scheduleR(A) R(B) R(B) W(A) COMMIT R(C) R(B) W(C) W(B) R(A) R(C) COMMIT COMMITThe above scedule is -:a)conflict serializableb)recoverablec)cascadelessd)all ...
sourav.
682
views
sourav.
asked
Jan 31, 2016
Databases
transaction-and-concurrency
databases
conflict-serializable
+
–
1
votes
1
answer
381
View and conflict Serializability
I want to confirm my answers.. For 19.2.1 a) VIEW equal serial order T1 T2T3 or T2T1T3 b) VIEW equal serial order 6 possible orders c) 2 VIEW equal serial orders d) 2 VIEW equal serial orders For 19.2.2 A) 2 VIEW equal serial ... b) 1 VIEW equal serial orders and 1 conflict equal.. { all schedules have 1 conflict equal serial order} Plz point out my mistakes.
I want to confirm my answers..For 19.2.1a) VIEW equal serial order T1 T2T3 or T2T1T3 b) VIEW equal serial order 6 possible ordersc) 2 VIEW equal serial ordersd) 2 VIEW eq...
khushtak
544
views
khushtak
asked
Jan 22, 2016
Databases
view-serializable
transaction-and-concurrency
databases
+
–
0
votes
2
answers
382
TestBook Test Series: Databases - Transactions
Akash Kanase
494
views
Akash Kanase
asked
Jan 15, 2016
Databases
testbook-test-series
databases
transaction-and-concurrency
+
–
5
votes
3
answers
383
how many view equivalent serial schedules are possible
how many view equivalent serial schedules are possible for the given schedule s: w1(a) r2(a) w3(a) r4(a) w5(a) r6(a) a) 2 b) 3 c) 6 d) 8
how many view equivalent serial schedules are possible for the given schedule s: w1(a) r2(a) w3(a) r4(a) w5(a) r6(a)a) 2b) 3c) 6d) 8
daksh
8.3k
views
daksh
asked
Jan 15, 2016
Databases
transaction-and-concurrency
+
–
5
votes
1
answer
384
Conservative 2 phase locking.
Is it Conservative 2 Phase locking (C2PL) ? T1 LOCK-X (A) LOCK-S (B) R(A) R(B) W(A) UNLOCK (A) COMMIT UNLOCK (B)
Is it Conservative 2 Phase locking (C2PL) ?T1LOCK-X (A)LOCK-S (B)R(A)R(B)W(A)UNLOCK (A)COMMITUNLOCK (B)
Shashank Chavan
1.2k
views
Shashank Chavan
asked
Jan 10, 2016
Databases
databases
transaction-and-concurrency
+
–
3
votes
4
answers
385
Seriaizability
Himanshu1
1.4k
views
Himanshu1
asked
Jan 5, 2016
Databases
databases
transaction-and-concurrency
view-serializable
+
–
6
votes
1
answer
386
Number of Cascadeless Schedules
Consider the following Two Transactions. How many Cascadeless schedules are possible over $T1$ & $T2$ ? $32$ $42$ $51$ $52$
Consider the following Two Transactions.How many Cascadeless schedules are possible over $T1$ & $T2$ ?$32$ $42$ $51$ $52$
Himanshu1
1.9k
views
Himanshu1
asked
Dec 23, 2015
Databases
databases
transaction-and-concurrency
+
–
17
votes
1
answer
387
How many recoverable schedules are possible from T1 and T2?
Consider the following Two Transactions. A) How many recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ? $51$ $52$ $55$ $56$ B) How many cascadeless recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ? $41$ $42$ $45$ $50$
Consider the following Two Transactions.A) How many recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ?$51$$52$$55$$56$ B) How many cascadeless recoverable s...
nilamd
4.5k
views
nilamd
asked
Dec 21, 2015
Databases
transaction-and-concurrency
databases
+
–
5
votes
2
answers
388
view serializability
t1 t2 w(x) r(x) w(x) commit commit Why is this not view serializable?
t1 t2w(x) r(x)w(x) commit commit...
divya_theodore
1.6k
views
divya_theodore
asked
Nov 14, 2015
Databases
databases
transaction-and-concurrency
view-serializable
+
–
5
votes
1
answer
389
How many conflict serializable schedules are possible ?
The transactions $T1$ and $T2$ are given as follows: $T1$: $R1(A)$ $W1(A)$ $R1(B)$ $W1(B)$ $T2$ : $R2(B)$ $W2(B)$ $R2(C)$ $W2(C)$ The total number of conflicts serializable that can be formed by $T1$ and $T2$ are Answer :20 (incorrect) The correct answer is 14
The transactions $T1$ and $T2$ are given as follows:$T1$: $R1(A)$ $W1(A)$ $R1(B)$ $W1(B)$$T2$ : $R2(B)$ $W2(B)$ $R2(C)$ $W2(C)$The total number of conflicts serializable ...
radha gogia
2.9k
views
radha gogia
asked
Oct 19, 2015
Databases
transaction-and-concurrency
+
–
1
votes
1
answer
390
Unrepeatable read problem
Shefali
3.4k
views
Shefali
asked
Oct 10, 2015
Databases
transaction-and-concurrency
+
–
Page:
« prev
1
...
8
9
10
11
12
13
14
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register