Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged transaction-and-concurrency
1
vote
2
answers
61
Is a Serial Schedule always Recoverable?
Is only conflict serializable schedules are recoverable? Or both view as well as conflict serializable schedules are recoverable? I have been seeing different answers in different forum.
DebRC
asked
in
Databases
Aug 16, 2022
by
DebRC
1.9k
views
databases
concurrency
transaction-and-concurrency
serializability
1
vote
1
answer
62
Databases
Someone Please Solve it
Overflow04
asked
in
Databases
Jul 5, 2022
by
Overflow04
508
views
ace-test-series
databases
transaction-and-concurrency
0
votes
0
answers
63
concurrency control
question about concurrency control methods
jayadev
asked
in
Databases
Jul 2, 2022
by
jayadev
350
views
transaction-and-concurrency
databases
concurrency
2phaselocking
12
votes
2
answers
64
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}$
Arjun
asked
in
Databases
Feb 15, 2022
by
Arjun
8.3k
views
gatecse-2022
databases
transaction-and-concurrency
conflict-serializable
2-marks
0
votes
1
answer
65
if we use timeout with wait die scheme is there starvation?
In wait and die scheme we don't have starvation, if we add timeout to it, does it change? I think if we add timeout, it can cause starvation the old transaction always timeout before runnin and a new transaction will be run. Is that so?
Tara22
asked
in
Databases
Feb 11, 2022
by
Tara22
454
views
transaction-and-concurrency
1
vote
1
answer
66
2 Phase Locking | Made Easy Test Series
Given Problem : S1 can be shown allowed under 2PL. However, the solution that they have provided for S2 : Seems wrong, as So, is S2 allowed under 2PL, or the answer given is incorrect?
palashbehra5
asked
in
Databases
Jan 17, 2022
by
palashbehra5
990
views
databases
transaction-and-concurrency
2phaselocking
serializability
0
votes
1
answer
67
Transactions and concurrency control
When Ti attempts to write data item Q, if TS(Ti ) < w-timestamp(Q), then Ti is attempting to write an obsolete value of {Q}. Rather than rolling back Ti as the timestamp ordering protocol would have done, this {write} operation can be ... Ti any transaction which comes after the Ti will have a chance of reading that change made by Ti by performing Read(Q) .
jayadev
asked
in
Databases
Dec 30, 2021
by
jayadev
435
views
transaction-and-concurrency
databases
concurrency
1
vote
1
answer
68
#selfdoubt
given schedule s: R2A W1B W1C R3B R2B R1A C1 R2C C2 W3A C3 How should I approach to above problem when LOCKS ARE NOT GIVEN and to find if s is 2PL ?
BHOJARAM
asked
in
Databases
Dec 28, 2021
by
BHOJARAM
494
views
transaction-and-concurrency
1
vote
2
answers
69
DBMS - Transactions and concurrency control
I had a doubt. In the case of lost update problem (special case of write – write problem, where a transaction commits to a blind write and the other transaction rollsback without commiting) , is the schedule recoverable or not??
Rutuja Desai
asked
in
Databases
Dec 2, 2021
by
Rutuja Desai
666
views
transaction-and-concurrency
databases
0
votes
0
answers
70
testseries
consider the log of transaction given below <T0,START> <T0,S,1000,2000> <T0,H,2,3> identify the correct actions which are part of undo(T0) ?? H is restored to 3. S is set to 1200. H is restored to 1000 <T0,S,1000,2000> log record is written out..
Abhishek tarpara
asked
in
Databases
Dec 1, 2021
by
Abhishek tarpara
329
views
databases
transaction-and-concurrency
made-easy-test-series
0
votes
1
answer
71
Haryana PGT
order of operations T1T2T1T2
Sanjay Sharma
asked
in
Databases
Nov 16, 2021
by
Sanjay Sharma
246
views
transaction-and-concurrency
1
vote
4
answers
72
self doubt
every strict recoverable schedule is conflict serializable..if not then why?
samarpita
asked
in
Databases
Nov 13, 2021
by
samarpita
602
views
transaction-and-concurrency
databases
1
vote
3
answers
73
Are all Irrecoverable/Non-Recoverable schedules cascading?
Suppose, T1: W(X), T2: R(X), T1: W(X), T2: Commit, T1: Abort Here we can see T2 is getting committed before T1 aborts, so it is clearly an Irrecoverable schedule but is it cascading?
DebRC
asked
in
Databases
Nov 2, 2021
by
DebRC
714
views
databases
transaction-and-concurrency
data
1
vote
1
answer
74
view serializable
Find View Serializable T1 : R1(A) , R1(B) , W1(B) T2 : R2(A) , R2(B) , W2(B)
sambey4
asked
in
Databases
Oct 15, 2021
by
sambey4
303
views
view-serializable
databases
transaction-and-concurrency
13
votes
2
answers
75
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
Arjun
asked
in
Databases
Feb 18, 2021
by
Arjun
7.0k
views
gatecse-2021-set2
databases
transaction-and-concurrency
conflict-serializable
2-marks
19
votes
2
answers
76
GATE CSE 2021 Set 1 | Question: 13
Suppose a database system crashes again while recovering from a previous crash. Assume checkpointing is not done by the database either during the transactions or during recovery. Which of the following statements is/are correct? The same ... All the transactions that are already undone and redone will not be recovered again The database will become inconsistent
Arjun
asked
in
Databases
Feb 18, 2021
by
Arjun
10.6k
views
gatecse-2021-set1
multiple-selects
databases
transaction-and-concurrency
1-mark
9
votes
3
answers
77
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
Arjun
asked
in
Databases
Feb 18, 2021
by
Arjun
5.4k
views
gatecse-2021-set1
databases
transaction-and-concurrency
conflict-serializable
2-marks
1
vote
1
answer
78
NIELIT Scientific Assistant A 2020 November: 78
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
gatecse
asked
in
Databases
Dec 9, 2020
by
gatecse
432
views
nielit-sta-2020
databases
transaction-and-concurrency
1
vote
2
answers
79
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 5
Assume transaction $A$ holds a shared lock $R.$ If transaction $B$ also requests for a shared lock on $R.$ It will result in deadlock situation immediately be granted immediately be rejected be granted as soon as it is released by $A$
admin
asked
in
Databases
Apr 1, 2020
by
admin
948
views
nielit2017oct-assistanta-it
databases
transaction-and-concurrency
deadlock-prevention-avoidance-detection
0
votes
1
answer
80
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 31
When transaction $Ti$ requests a data item currently held by $Tj,Ti$ is allowed to wait only if it has a time stamp smaller than that of $Tj$ (that is $Ti$ is order than Tj). Otherwise, $Ti$ is rolled back (dies). This is Wait-die Wait-wound Wound-wait Wait
admin
asked
in
Databases
Apr 1, 2020
by
admin
709
views
nielit2017oct-assistanta-it
databases
transaction-and-concurrency
1
vote
3
answers
81
NIELIT 2017 OCT Scientific Assistant A (CS) - Section C: 10
When transaction $Ti$ requests a data item currently held by $Tj,Ti$ is allowed to wait only if it has a timestamp smaller than that of $Tj$ (that is $Ti$ is order than Tj). Otherwise, $Ti$ is rolled back (dies). This is Wait-die Wait-wound Wound-wait Wait
admin
asked
in
Databases
Apr 1, 2020
by
admin
1.4k
views
nielit2017oct-assistanta-cs
databases
transaction-and-concurrency
1
vote
1
answer
82
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 34
Assume transaction $A$ holds a shared lock $R.$ If transaction $B$ also requests for a shared lock on $R.$ It will result in deadlock situation immediately be granted immediately be rejected be granted as soon as it is released by $A$
admin
asked
in
Databases
Apr 1, 2020
by
admin
1.8k
views
nielit2017oct-assistanta-cs
databases
transaction-and-concurrency
deadlock-prevention-avoidance-detection
0
votes
1
answer
83
NIELIT 2016 MAR Scientist B - Section C: 34
Global locks synchronize access to local resources. synchronize access to global resources. are used to avoid local locks. prevent access to global resources.
admin
asked
in
Databases
Mar 31, 2020
by
admin
690
views
nielit2016mar-scientistb
databases
transaction-and-concurrency
lock
2
votes
3
answers
84
NIELIT 2017 DEC Scientist B - Section B: 18
In conservative two phase locking protocol, a transaction Should release all the locks only at the beginning of transaction Should release exclusive locks only after the commit operation Should acquire all the exclusive locks at the beginning of transaction Should acquire all the locks at the beginning of transaction
admin
asked
in
Databases
Mar 30, 2020
by
admin
2.7k
views
nielit2017dec-scientistb
databases
transaction-and-concurrency
two-phase-locking-protocol
1
vote
7
answers
85
UGC NET CSE | January 2017 | Part 3 | Question: 7
Consider following schedules involving two transactions: $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 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
go_editor
asked
in
Databases
Mar 24, 2020
by
go_editor
3.8k
views
ugcnetcse-jan2017-paper3
databases
transaction-and-concurrency
20
votes
5
answers
86
GATE CSE 2020 | Question: 37
Consider a schedule of transactions $T_1$ and $T_2$ ...
Arjun
asked
in
Databases
Feb 12, 2020
by
Arjun
11.7k
views
gatecse-2020
databases
transaction-and-concurrency
2-marks
Page:
« prev
1
2
3
4
5
6
7
8
...
14
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged transaction-and-concurrency
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...