Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged transaction-and-concurrency
4
votes
2
answers
391
How is this schedule not allowed in Strict 2PL, but allowed in 2PL ?
$\begin{bmatrix} T1 &T2 \\ R(A) & \\ W(A)& \\ & R(A)\\ & W(A)\\ &R(B) \\ &W(B) \\ & Commit\\ Abort& \end{bmatrix}$ How is this schedule allowed in 2PL ? In 2PL ... phase in , which is not present in T2 ..? This example is given in the book by Raghu Ramkrishnan on page 529 and 552 (for reference)
$\begin{bmatrix} T1 &T2 \\ R(A) & \\ W(A)& \\ & R(A)\\ & W(A)\\ &R(B) \\ &W(B) \\ & Commit\\ Abort& \end{bmatrix}$How is this schedule allowed in 2PL ? In 2PL , there mus...
learncp
2.6k
views
learncp
asked
Oct 7, 2015
Databases
databases
transaction-and-concurrency
+
–
2
votes
2
answers
392
In 2 Phase locking protocol, how does a deadlock happen ?
According to 2-phase locking protocol, if a transaction acquires an exclusive lock on any object, another transaction cannot obtain any kind of lock on it till the first transaction unlocks it. Is the reverse also true, i.,e., if ... cannot acquire any kind of lock on it..? or it cannot acquire exclusive lock, but can acquire shared lock. ?
According to 2-phase locking protocol, if a transaction acquires an exclusive lock on any object, another transaction cannot obtain any kind of lock on it till the first ...
learncp
2.3k
views
learncp
asked
Sep 29, 2015
Databases
databases
transaction-and-concurrency
+
–
1
votes
3
answers
393
How to check the view serializability of a given schedule ?
Suppose we have a schedule containing two transactions as shown- ... , for A we will get t1->t2, and for B we will get t1->t2.. Same graph will be obtained if we draw a single polygraph
Suppose we have a schedule containing two transactions as shown-$\begin{bmatrix} T1 & T2 \\ R(A) & \\ W(A) & \\ & R(A) \\ & W(A) \\ R(B)& \\ W(B)& \\ & R(B) \\ & W(...
learncp
1.5k
views
learncp
asked
Sep 18, 2015
Databases
databases
transaction-and-concurrency
view-serializable
+
–
8
votes
1
answer
394
What is the difference between a Strict schedule and a Cascadeless schedule ?
I am unable to differentiate between a strict schedule and a cascadeless schedule...although what I have understood is that in strict schedule, we cannot perform read/write till the other transaction commits..but isnt this condition also valid for cascadeless schedules ? Can someone please explain by giving an example.
I am unable to differentiate between a strict schedule and a cascadeless schedule...although what I have understood is that in strict schedule, we cannot perform read/wri...
learncp
10.9k
views
learncp
asked
Sep 18, 2015
Databases
databases
transaction-and-concurrency
+
–
62
votes
5
answers
395
GATE CSE 2015 Set 3 | Question: 29
Consider the partial Schedule $S$ involving two transactions $T1$ and $T2$. Only the $\textit{read}$ and the $\textit{write}$ operations have been shown. The $\textit{read}$ operation on data item $P$ ... re-started to ensure transaction atomicity Schedule $S$ is recoverable and can ensure transaction atomicity and nothing else needs to be done
Consider the partial Schedule $S$ involving two transactions $T1$ and $T2$. Only the $\textit{read}$ and the $\textit{write}$ operations have been shown. The $\textit{rea...
go_editor
14.5k
views
go_editor
asked
Feb 15, 2015
Databases
gatecse-2015-set3
databases
transaction-and-concurrency
normal
+
–
57
votes
5
answers
396
GATE CSE 2015 Set 2 | Question: 46
Consider a simple checkpointing protocol and the following set of operations in the log. (start, T4); (write, T4, y, 2, 3); (start, T1); (commit, T4); (write, T1, z, 5, 7); (checkpoint); (start, T2); (write, T2, x, 1, 9); (commit, T2); (start, T3); ( ... Undo: T3, T1; Redo: T2 Undo: T3, T1; Redo: T2, T4 Undo: none; Redo: T2, T4, T3, T1 Undo: T3, T1, T4; Redo: T2
Consider a simple checkpointing protocol and the following set of operations in the log.(start, T4); (write, T4, y, 2, 3); (start, T1); (commit, T4); (write, T1, z, 5, 7)...
go_editor
24.8k
views
go_editor
asked
Feb 13, 2015
Databases
gatecse-2015-set2
databases
transaction-and-concurrency
normal
+
–
33
votes
4
answers
397
GATE CSE 2015 Set 2 | Question: 1
Consider the following transaction involving two bank accounts $x$ and $y$. read(x); x:=x-50; write (x); read(y); y:=y+50; write(y) The constraint that the sum of the accounts $x$ and $y$ should remain constant is that of Atomicity Consistency Isolation Durability
Consider the following transaction involving two bank accounts $x$ and $y$.read(x); x:=x-50; write (x); read(y); y:=y+50; write(y)The constraint that the sum of the accou...
go_editor
14.9k
views
go_editor
asked
Feb 12, 2015
Databases
gatecse-2015-set2
databases
transaction-and-concurrency
easy
+
–
6
votes
3
answers
398
Consider 3 transactions T1, T2 and T3 having 2, 3 and 4 operations respectively.
Consider $3$ transactions $T_1, T_2$ and $T_3$ having $2, 3$ and $4$ operations respectively. Find the number of concurrent schedules?
Consider $3$ transactions $T_1, T_2$ and $T_3$ having $2, 3$ and $4$ operations respectively. Find the number of concurrent schedules?
Vikrant Singh
18.1k
views
Vikrant Singh
asked
Jan 29, 2015
Databases
transaction-and-concurrency
databases
+
–
1
votes
1
answer
399
please explain with the help of example WW problem and lost update problem and what is the difference between them?
neha pawar
1.8k
views
neha pawar
asked
Nov 4, 2014
Databases
databases
transaction-and-concurrency
+
–
42
votes
1
answer
400
GATE IT 2005 | Question: 67
A company maintains records of sales made by its salespersons and pays them commission based on each individual's total sales made in a year. This data is maintained in a table with following schema: salesinfo = (salespersonid, ... running concurrently throughout Execute T3 followed by T2; T1 running concurrently throughout Execute T3 followed by T2 followed by T1
A company maintains records of sales made by its salespersons and pays them commission based on each individual's total sales made in a year. This data is maintained in a...
Ishrat Jahan
8.1k
views
Ishrat Jahan
asked
Nov 3, 2014
Databases
gateit-2005
databases
transaction-and-concurrency
normal
+
–
34
votes
1
answer
401
GATE IT 2005 | Question: 24
Amongst the ACID properties of a transaction, the 'Durability' property requires that the changes made to the database by a successful transaction persist Except in case of an Operating System crash Except in case of a Disk crash Except in case of a power failure Always, even if there is a failure of any kind
Amongst the ACID properties of a transaction, the 'Durability' property requires that the changes made to the database by a successful transaction persistExcept in case o...
Ishrat Jahan
6.6k
views
Ishrat Jahan
asked
Nov 3, 2014
Databases
gateit-2005
databases
transaction-and-concurrency
easy
+
–
43
votes
6
answers
402
GATE IT 2004 | Question: 77
Consider the following schedule $S$ of transactions $T1$ and $T2:$ ... only as $T2, T1$ $S$ is serializable both as $T1, T2$ and $T2, T1$ $S$ is not serializable either as $T1,T2$ or as $T2,T1$
Consider the following schedule $S$ of transactions $T1$ and $T2:$$${\begin{array}{l|l}\textbf{T1}& \textbf{T2} \\\hline\text{Read(A)} \\\text{A = A – 10}\\& \text...
Ishrat Jahan
12.4k
views
Ishrat Jahan
asked
Nov 2, 2014
Databases
gateit-2004
databases
transaction-and-concurrency
normal
+
–
34
votes
5
answers
403
GATE IT 2004 | Question: 21
Which level of locking provides the highest degree of concurrency in a relational database ? Page Table Row Page, table and row level locking allow the same degree of concurrency
Which level of locking provides the highest degree of concurrency in a relational database ?PageTableRowPage, table and row level locking allow the same degree of concurr...
Ishrat Jahan
18.8k
views
Ishrat Jahan
asked
Nov 2, 2014
Databases
gateit-2004
databases
normal
transaction-and-concurrency
+
–
53
votes
5
answers
404
GATE IT 2007 | Question: 66
Consider the following two transactions$: T1$ and $T2.$ ...
Consider the following two transactions$: T1$ and $T2.$$\begin{array}{clcl} T1: & \text{read (A);} & T2: & \text{read (B);} \\ & \text{read (B);} & & \text{read (A);} \\ ...
Ishrat Jahan
18.1k
views
Ishrat Jahan
asked
Oct 30, 2014
Databases
gateit-2007
databases
transaction-and-concurrency
normal
+
–
42
votes
8
answers
405
GATE IT 2008 | Question: 63
Consider the following three schedules of transactions T1, T2 and T3. [Notation: In the following NYO represents the action Y (R for read, W for write) performed by transaction N on object O.] ... equivalent to each other S2 is conflict equivalent to S3, but not to S1 S1 is conflict equivalent to S2, but not to S3
Consider the following three schedules of transactions T1, T2 and T3. [Notation: In the following NYO represents the action Y (R for read, W for write) performed by trans...
Ishrat Jahan
18.7k
views
Ishrat Jahan
asked
Oct 28, 2014
Databases
gateit-2008
databases
transaction-and-concurrency
normal
+
–
0
votes
1
answer
406
time stamp ordering
Consider the following sequence of actions. r1(A) r2(B) w1(C) r3(B) r3(C) w2(B) w3(A) Which of the following time stamp ordering allowed to execute the schedule using basic time stamp protocol? A) (T1, T2, T3) = (10, 30, 20) B) (T1, T2, T3) = (20, 30, 10) C) (T1, T2, T3) = (30, 20, 10) D) (T1, T2, T3) = (10, 20, 30)
Consider the following sequence of actions.r1(A) r2(B) w1(C) r3(B) r3(C) w2(B) w3(A)Which of the following time stamp ordering allowed to execute the schedule using basic...
Keith Kr
1.4k
views
Keith Kr
asked
Oct 19, 2014
Databases
databases
transaction-and-concurrency
+
–
31
votes
4
answers
407
GATE CSE 2010 | Question: 42
Consider the following schedule for transactions $T1, T2$ and $T3:$ ... correct serialization of the above? $T1 \to T3 \to T2$ $T2 \to T1 \to T3$ $T2 \to T3 \to T1$ $T3 \to T1 \to T2$
Consider the following schedule for transactions $T1, T2$ and $T3:$$$\begin{array}{|c|c|c|}\hline \textbf{T1} & \textbf{T2} & \textbf{T3} \\\hline \text{Read(X)} & \text...
go_editor
10.6k
views
go_editor
asked
Sep 30, 2014
Databases
gatecse-2010
databases
transaction-and-concurrency
normal
+
–
51
votes
6
answers
408
GATE CSE 2010 | Question: 20
Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock? $2$-phase locking Time-stamp ordering I only II only Both I and II Neither I nor II
Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?$2$-phase lockingTime-stamp orderingI onlyII onlyBoth ...
go_editor
22.8k
views
go_editor
asked
Sep 29, 2014
Databases
gatecse-2010
databases
transaction-and-concurrency
normal
+
–
30
votes
2
answers
409
GATE CSE 2014 Set 3 | Question: 29
Consider the transactions $T1, T2, \:\text{and} \:T3$ and the schedules $S1 \:\text{and} \:S2$ given below. $T1: r1(X); r1(Z); w1(X); w1(Z) $ $T2: r2(Y); r2(Z); w2(Z) $ $T3: r3(Y); r3(X); w3(Y) $ ... Only $S1$ is conflict-serializable. Only $S2$ is conflict-serializable. Both $S1$ and $S2$ are conflict-serializable. Neither $S1$ nor $S2$ is conflict-serializable.
Consider the transactions $T1, T2, \:\text{and} \:T3$ and the schedules $S1 \:\text{and} \:S2$ given below. $T1: r1(X); r1(Z); w1(X); w1(Z) $$T2: r2(Y); r2(Z); w2(Z) $$T3...
go_editor
8.5k
views
go_editor
asked
Sep 28, 2014
Databases
gatecse-2014-set3
databases
transaction-and-concurrency
conflict-serializable
normal
+
–
61
votes
3
answers
410
GATE CSE 2014 Set 2 | Question: 29
Consider the following schedule S of transactions $T1, T2, T3, T4:$ ... S is not conflict-serializable but is recoverable S is both conflict-serializable and recoverable S is neither conflict-serializable not is it recoverable
Consider the following schedule S of transactions $T1, T2, T3, T4:$$${\begin{array}{|l|l|l|l|}\hline\textbf{T1}& \textbf{T2}& \textbf{T3}& \textbf{T4} \\\hline& \...
go_editor
28.5k
views
go_editor
asked
Sep 28, 2014
Databases
gatecse-2014-set2
databases
transaction-and-concurrency
conflict-serializable
normal
+
–
25
votes
3
answers
411
GATE CSE 2014 Set 1 | Question: 29
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by $r(x)$ and $w(x)$ respectively. Which one of them is conflict serializable? $r_1(x)$; $r_2(x)$; $w_1(x)$; $r_3(x)$; $w_2(x)$; $r_2(x)$; ... $r_1(x)$; $w_2(x)$; $w_1(x)$; $r_2(x)$; $w_2(x)$; $r_3(x)$; $r_1(x)$; $w_1(x)$;
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by $r(x)$ and $w(x)$ respectiv...
go_editor
8.7k
views
go_editor
asked
Sep 26, 2014
Databases
gatecse-2014-set1
databases
transaction-and-concurrency
conflict-serializable
normal
+
–
70
votes
7
answers
412
GATE CSE 2012 | Question: 27
Consider the following transactions with data items $P$ and $Q$ initialized to zero: ${\begin{array}{|c|l|r|c|}\hline \textbf{$ ... leads to a serializable schedule a schedule that is not conflict serializable a conflict serializable schedule a schedule for which a precedence graph cannot be drawn
Consider the following transactions with data items $P$ and $Q$ initialized to zero:$${\begin{array}{|c|l|r|c|}\hline \textbf{$T_1$}& \text{read (P);}\\ & \text{read...
Arjun
22.8k
views
Arjun
asked
Sep 25, 2014
Databases
gatecse-2012
databases
transaction-and-concurrency
normal
+
–
53
votes
3
answers
413
GATE CSE 1999 | Question: 2.6
For the schedule given below, which of the following is correct: ... schedule is not serializable but can occur in a scheme using 2PL protocol This schedule is not serializable and cannot occur in a scheme using 2PL protocol
For the schedule given below, which of the following is correct:$$\begin{array}{ll} \text{1} & \text{Read A} & \text{} \\ \text{2} & \text{} & \text{Read B} \\ \text{3...
Kathleen
14.3k
views
Kathleen
asked
Sep 23, 2014
Databases
gate1999
databases
transaction-and-concurrency
normal
+
–
30
votes
2
answers
414
GATE CSE 2009 | Question: 43
Consider two transactions $T_1$ and $T_2$, and four schedules $S_1, S_2, S_3, S_4$, of $T_1$ and $T_2$ as given below: $T_1: R_1[x]W_1[x]W_1[y]$ $T_2: R_2[x]R_2[y]W_2[y]$ $S_1: R_1[x]R_2[x]R_2[y] W_1[x] W_1[y] W_2[y]$ ... $S_1 \text{ and } S_2$ $S_2 \text{ and } S_3$ $S_3$ only $S_4$ only
Consider two transactions $T_1$ and $T_2$, and four schedules $S_1, S_2, S_3, S_4$, of $T_1$ and $T_2$ as given below:$T_1: R_1[x]W_1[x]W_1[y]$$T_2: R_2[x]R_2[y]W_2[y...
Kathleen
6.7k
views
Kathleen
asked
Sep 22, 2014
Databases
gatecse-2009
databases
transaction-and-concurrency
normal
+
–
27
votes
5
answers
415
GATE CSE 2007 | Question: 64
Consider the following schedules involving two transactions. Which one of the following statements is TRUE? $S_1 :r_1(X); r_1(Y); r_2(X); r_2(Y); w_2(Y); w_1(X)$ ... is not conflict serializable. $S_1$ is not conflict serializable and $S_2$ is conflict serializable. Both $S_1$ and $S_2$ are not conflict serializable.
Consider the following schedules involving two transactions. Which one of the following statements is TRUE?$S_1 :r_1(X); r_1(Y); r_2(X); r_2(Y); w_2(Y); w_1(X)$$S_2 :r_1(...
Kathleen
9.6k
views
Kathleen
asked
Sep 21, 2014
Databases
gatecse-2007
databases
transaction-and-concurrency
normal
+
–
69
votes
9
answers
416
GATE CSE 2006 | Question: 20, ISRO2015-17
Consider the following log sequence of two transactions on a bank account, with initial balance $12000,$ that transfer $2000$ to a mortgage payment and then apply a $5\%$ interest. T1 start T1 B old $=12000$ new $=10000$ ... $3$ because transaction T1 has committed We can apply redo and undo operations in arbitrary order because they are idempotent
Consider the following log sequence of two transactions on a bank account, with initial balance $12000,$ that transfer $2000$ to a mortgage payment and then apply a $5\%$...
Rucha Shelke
28.1k
views
Rucha Shelke
asked
Sep 17, 2014
Databases
gatecse-2006
databases
transaction-and-concurrency
normal
isro2015
+
–
46
votes
6
answers
417
GATE CSE 2003 | Question: 87
Consider three data items $D1, D2,$ and $D3,$ and the following execution schedule of transactions $T1, T2,$ and $T3.$ In the diagram, $R(D)$ and $W(D)$ denote the actions reading and writing the data item $D$ ... $T2; T1; T3$ The schedule is serializable as $T3; T2; T1$ The schedule is not serializable
Consider three data items $D1, D2,$ and $D3,$ and the following execution schedule of transactions $T1, T2,$ and $T3.$ In the diagram, $R(D)$ and $W(D)$ denote the action...
Kathleen
11.4k
views
Kathleen
asked
Sep 17, 2014
Databases
gatecse-2003
databases
transaction-and-concurrency
normal
+
–
51
votes
5
answers
418
GATE CSE 2003 | Question: 29, ISRO2009-73
Which of the following scenarios may lead to an irrecoverable error in a database system? A transaction writes a data item after it is read by an uncommitted transaction A transaction reads a data item after it is read by an ... it is written by a committed transaction A transaction reads a data item after it is written by an uncommitted transaction
Which of the following scenarios may lead to an irrecoverable error in a database system?A transaction writes a data item after it is read by an uncommitted transactionA ...
Kathleen
14.8k
views
Kathleen
asked
Sep 16, 2014
Databases
gatecse-2003
databases
transaction-and-concurrency
easy
isro2009
+
–
Page:
« prev
1
...
9
10
11
12
13
14
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register