Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for conflict-serializable
150
votes
18
answers
1
GATE CSE 2017 Set 2 | Question: 44
Two transactions $T_1$ and $T_2$ are given as $T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$ $T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$ where $r_i(V)$ denotes a $\textit{read}$ operation by transaction $T_i$ on a variable $V$ and $w_i(V)$ denotes a ... by transaction $T_i$ on a variable $V$. The total number of conflict serializable schedules that can be formed by $T_1$ and $T_2$ is ______
Two transactions $T_1$ and $T_2$ are given as$T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$$T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$where $r_i(V)$ denotes a $\textit{read}$ operation by transaction...
Madhav
72.8k
views
Madhav
asked
Feb 14, 2017
Databases
gatecse-2017-set2
databases
transaction-and-concurrency
numerical-answers
conflict-serializable
+
–
61
votes
3
answers
2
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
+
–
1
votes
1
answer
3
GATE CSE 2024 | Set 1 | Question: 36
Consider the following read-write schedule $\text{S}$ over three transactions $T_{1}, T_{2}$, and $T_{3}$ ... to $\text{S}$? $T_{1} T_{2} T_{3}$ $T_{1} T_{3} T_{2}$ $T_{3} T_{2} T_{1}$ $T_{3} T_{1} T_{2}$
Consider the following read-write schedule $\text{S}$ over three transactions $T_{1}, T_{2}$, and $T_{3}$, where the subscripts in the schedule indicate trans...
Arjun
2.3k
views
Arjun
asked
Feb 16
Databases
gatecse2024-set1
databases
conflict-serializable
multiple-selects
+
–
3
votes
1
answer
4
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 33
Consider the following two schedules consisting to two transaction $\mathrm{T}_1$ and $\mathrm{T}_2$ : Which of the following is/are true about these schedules? Both $\mathrm{S}_1$ and $\mathrm{S}_2$ are ... and also conflict serializable. $\mathrm{S}_1$ and $\mathrm{S}_2$ are neither conflict equivalent nor conflict serializable.
Consider the following two schedules consisting to two transaction $\mathrm{T}_1$ and $\mathrm{T}_2$ :Which of the following is/are true about these schedules?Both $\math...
GO Classes
281
views
GO Classes
asked
Jan 28
Databases
goclasses2024-mockgate-13
goclasses
databases
transaction-and-concurrency
conflict-serializable
1-mark
+
–
4
votes
0
answers
5
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 59
Which of the following statements is/are false? In a cascade-less schedule if a transaction $T_j$ read a data item written by transaction $T_i$ then the commit of $T_i$ has to be before this read operation of $T_j$ A ... $2 \mathrm{PL}$ (could have been produced using the $2 \mathrm{PL}$ locking protocol) is conflict-serializable.
Which of the following statements is/are false?In a cascade-less schedule if a transaction $T_j$ read a data item written by transaction $T_i$ then the commit of $T_i$ ha...
GO Classes
451
views
GO Classes
asked
Jan 13
Databases
goclasses2024-mockgate-11
goclasses
databases
transaction-and-concurrency
conflict-serializable
multiple-selects
2-marks
+
–
12
votes
2
answers
6
GATE CSE 2022 | Question: 29
Let $\textit{R}_{i}(z)$ and $\textit{W}_{i}(z)$ denote read and write operations on a data element $z$ by a transaction $\textit{T}_{i},$ respectively. Consider the schedule $\textit{S}$ ... $T_{4} \rightarrow T_{1} \rightarrow T_{3} \rightarrow T_{2}$ $T_{3} \rightarrow T_{1} \rightarrow T_{4} \rightarrow T_{2}$
Let $\textit{R}_{i}(z)$ and $\textit{W}_{i}(z)$ denote read and write operations on a data element $z$ by a transaction $\textit{T}_{i},$ respectively. Consider the sched...
Arjun
8.6k
views
Arjun
asked
Feb 15, 2022
Databases
gatecse-2022
databases
transaction-and-concurrency
conflict-serializable
2-marks
+
–
25
votes
3
answers
7
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
+
–
0
votes
1
answer
8
Number of Conflict Serializable Schedules
How many total $Conflict$ $Serializable$ $Schedules$ are possible that can be formed by $T1$ and $T2?$ $T1:$ $r_1(A)$ $r_1(B)$ $w_1(B)$ $T2:$ $r_2(B)$ $r_2(A)$ $w_2(B)$
How many total $Conflict$ $Serializable$ $Schedules$ are possible that can be formed by $T1$ and $T2?$$T1:$ $r_1(A)$ $r_1(B)$ $w_1(B)$$T2:$ $r_2(B)$ $r_2(A)$ $w_2(B)$
Harsh Saini_1
397
views
Harsh Saini_1
asked
Dec 27, 2023
Databases
transaction-and-concurrency
conflict-serializable
databases
+
–
0
votes
0
answers
9
Made easy DBMS
amitarp818
216
views
amitarp818
asked
Dec 5, 2023
Databases
made-easy-test-series
databases
conflict-serializable
+
–
0
votes
0
answers
10
madeeasy ots
Sajal Mallick
176
views
Sajal Mallick
asked
Nov 20, 2023
Databases
made-easy-test-series
transaction-and-concurrency
conflict-serializable
databases
+
–
0
votes
0
answers
11
madeeasy workbook
According to me answer is 2.Is it right? Suggestion is needed how to approach this if it is given in more complexity.
According to me answer is 2.Is it right? Suggestion is needed how to approach this if it is given in more complexity.
Sajal Mallick
179
views
Sajal Mallick
asked
Nov 20, 2023
Databases
made-easy-booklet
databases
transaction-and-concurrency
conflict-serializable
+
–
1
votes
1
answer
12
GO Classes 2023 | IIITH Mock Test 1 | Question: 19
Assume by "Serializability", we mean "Conflict Serializability". For the given schedule, which of the following is TRUE? $\text{T}_1$ $\text{T}_2$ $\text{T}_3$ $\text{T}_4$ Read(A) Read(A) Read(A) Write(B) Write(A) Read ... $\text{T}_2, \text{T}_3, \text{T}_1, \text{T}_4$
Assume by "Serializability", we mean "Conflict Serializability".For the given schedule, which of the following is TRUE?$\text{T}_1$$\text{T}_2$$\text{T}_3$$\text{T}_4$ ...
GO Classes
613
views
GO Classes
asked
Mar 26, 2023
Databases
goclasses2023-iiith-mock-1
goclasses
databases
transaction-and-concurrency
conflict-serializable
1-mark
+
–
13
votes
2
answers
13
GATE CSE 2021 Set 2 | Question: 32
Let $S$ be the following schedule of operations of three transactions $T_1$, $T_2$ and $T_3$ in a relational database system: $R_2(Y), R_1(X), R_3(Z), R_1(Y)W_1(X), R_2(Z), W_2(Y), R_3(X), W_3(Z)$ Consider the statements $P$ and $Q$ below: $P$ ... Both $P$ and $Q$ are true $P$ is true and $Q$ is false $P$ is false and $Q$ is true Both $P$ and $Q$ are false
Let $S$ be the following schedule of operations of three transactions $T_1$, $T_2$ and $T_3$ in a relational database system:$$R_2(Y), R_1(X), R_3(Z), R_1(...
Arjun
7.2k
views
Arjun
asked
Feb 18, 2021
Databases
gatecse-2021-set2
databases
transaction-and-concurrency
conflict-serializable
2-marks
+
–
0
votes
1
answer
14
Self Doubt on serializable
If a schedule is not conflict-serializable. Is it serializable?
If a schedule is not conflict-serializable. Is it serializable?
abhinowKatore
262
views
abhinowKatore
asked
Sep 8, 2022
Databases
view-serializable
databases
conflict-serializable
+
–
0
votes
0
answers
15
Serializability
What is Proof/Explanation for complexity to test if a schedule is conflict serializable is O(n^2) whereas for view serializable is O(2^n)-Exponential ?
What is Proof/Explanation for complexity to test if a schedule is conflict serializable is O(n^2) whereas for view serializable is O(2^n)-Exponential ?
SakarKoot
237
views
SakarKoot
asked
Sep 4, 2022
Databases
transactions-and-concurrency-control
conflict-serializable
view-serializable
+
–
0
votes
1
answer
16
conflict serializable
Find Total no of conflict serializable and view serializable T1: R1(A) W1(A) R1(B) W1(B) T2: R2(A) W2(A) R2(B) W2(B)
Find Total no of conflict serializable and view serializableT1: R1(A) W1(A) R1(B) W1(B)T2: R2(A) W2(A) R2(B) W2(B)
sambey4
315
views
sambey4
asked
Oct 16, 2021
Databases
databases
conflict-serializable
view-serializable
+
–
9
votes
3
answers
17
GATE CSE 2021 Set 1 | Question: 32
Let $r_i(z)$ and $w_i(z)$ denote read and write operations respectively on a data item $z$ by a transaction $T_i$. Consider the following two schedules. $S_1: r_1(x)r_1(y)r_2(x)r_2(y)w_2(y)w_1(x)$ ... serializable, and $S_2$ is conflict serializable Both $S_1$ and $S_2$ are conflict serializable Niether $S_1$ nor $S_2$ is conflict serializable
Let $r_i(z)$ and $w_i(z)$ denote read and write operations respectively on a data item $z$ by a transaction $T_i$. Consider the following two schedules.$S_1: r_1(x)r_1(y)...
Arjun
5.6k
views
Arjun
asked
Feb 18, 2021
Databases
gatecse-2021-set1
databases
transaction-and-concurrency
conflict-serializable
2-marks
+
–
0
votes
1
answer
18
Self doubt - Serializability - DBMS
Can a schedule be serializable if it is not view serializable? Are conflict equivalence and view equivalence the only two ways to decide if a schedule is serializable?
Can a schedule be serializable if it is not view serializable? Are conflict equivalence and view equivalence the only two ways to decide if a schedule is serializable?
atulcse
459
views
atulcse
asked
Nov 2, 2021
Databases
view-serializable
conflict-serializable
databases
+
–
0
votes
2
answers
19
Self doubt on 2PL protocol
How can 2PL protocol ( simple one ) ensure conflict serializability even though it cannot ensure freedom from deadlock ? I mean ,if a schedule is conflict serializable it has a conflict equivalent to a serial schedule and serial schedules won't have deadlocks .Right ?
How can 2PL protocol ( simple one ) ensure conflict serializability even though it cannot ensure freedom from deadlock ?I mean ,if a schedule is conflict serializable it...
ashunimbz
589
views
ashunimbz
asked
Mar 30, 2019
Databases
-2phaselocking
conflict-serializable
transaction-and-concurrency
databases
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register