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
2
votes
1
answer
271
The time stamp of two transactions T1 and T2 are 10 and 15. Consider the following schedule with T1 and T2 operations.
techbrk3
asked
in
Databases
Nov 9, 2017
by
techbrk3
1.7k
views
databases
transaction-and-concurrency
2
votes
1
answer
272
In basic timestamp ordering, say a transaction T issues write (Q) operation, then which of the below is true?
techbrk3
asked
in
Databases
Nov 9, 2017
by
techbrk3
1.5k
views
databases
transaction-and-concurrency
test-series
0
votes
1
answer
273
Madeeasy test series
Why is this schedule not allowed under strict two phase locking?
Kishan Kumar
asked
in
Databases
Nov 7, 2017
by
Kishan Kumar
325
views
transaction-and-concurrency
1
vote
1
answer
274
UGC NET CSE | November 2017 | Part 3 | Question: 8
Suppose a database schedule S involves transactions $T1, T2, \dots,Tn$. Consider the precedence graph of $S$ with vertices representing the transactions and edges representing the conflicts. If $S$ is serializable, which ... yield a serial schedule? Topological order Depth - first order Breadth - first order Ascending order of transactions indices
Arjun
asked
in
Databases
Nov 5, 2017
by
Arjun
718
views
ugcnetcse-nov2017-paper3
databases
transaction-and-concurrency
2
votes
1
answer
275
UGC NET CSE | November 2017 | Part 3 | Question: 7
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? $S1$: $r1(X); r2(X); w1(X); r3(X); w2(X)$ $S2$ : ... $S4$ : $r2(X); w2(X); r3(X); r1(X); w1(X)$ $S1$ $S2$ $S3$ $S4$
Arjun
asked
in
Databases
Nov 5, 2017
by
Arjun
1.0k
views
ugcnetcse-nov2017-paper3
databases
transaction-and-concurrency
1
vote
0
answers
276
Transaction
Wait die is non preemptive technique :So cannot suffer from starvation. Wound wait is preemptive technique : is it suffers from starvation? i think yes but not sure plz explain with some example:
Anu007
asked
in
Databases
Nov 3, 2017
by
Anu007
683
views
transaction-and-concurrency
deadlock-prevention-avoidance-detection
2
votes
2
answers
277
Dbms #self doubt
1. How many super key is possible if (a,bc,cd) is candidate key and R(ABCDEF) #DOUBT When we use veen digram why we are taking only intersections part only ??? Need help please explain ..
air1ankit
asked
in
Databases
Oct 26, 2017
by
air1ankit
546
views
databases
relational-algebra
database-normalization
transaction-and-concurrency
2
votes
1
answer
278
transaction control
In basic time stamp ordering W-time stamp (Q) denotes the largest time stamp of any transaction that has executed write-(Q) successfully.Suppose that we define W-time stamp(Q) as the most recent transaction to execute Write(Q) successfully.Which is ... give same result in few cases 3)both with give different result in all cases 4)both with give different result insome cases
set2018
asked
in
Databases
Oct 24, 2017
by
set2018
2.7k
views
transaction-and-concurrency
databases
1
vote
1
answer
279
Transactions Serializable schedule and Unserializable Schedule
Some where I have read, that WR, RW, WW problem occurs only in un-serializable schedule, and Irrecoverable problem, cascade less rollback problem and lost update problems occur in serializable schedule. Is the above statement true or false?
Shubhanshu
asked
in
Databases
Oct 22, 2017
by
Shubhanshu
412
views
databases
transaction-and-concurrency
concurrency
2
votes
0
answers
280
Transactions
shivangi5
asked
in
Databases
Oct 16, 2017
by
shivangi5
398
views
databases
transaction-and-concurrency
conflict-serializable
1
vote
1
answer
281
MadeEasy Subject Test: Databases - Transactions
Rishi yadav
asked
in
Databases
Oct 7, 2017
by
Rishi yadav
432
views
databases
made-easy-test-series
transaction-and-concurrency
1
vote
2
answers
282
Doubt Question on Transaction schedules
Consider a Serial Schedule given- T1 T2 T3 w1(A) w1(B) r2(A) w2(B) r3(A) w3(B) How many schedules which are view equivalent to above schedule? How many schedules which are confilct equivalent to above schedule? ... serializable/ view serializable? If yes How many serial schedules are possible which are conflict equivalent/ view equivalent to able schedule?
Durgesh Singh
asked
in
Databases
Sep 30, 2017
by
Durgesh Singh
892
views
databases
transaction-and-concurrency
view-serializable
conflict-serializable
1
vote
1
answer
283
Test by Bikram | Databases | Test 2 | Question: 28
Given below are some transaction schedules that involve three transactions $T1 \ T2 \ T3$: $\textbf{Schedule 1:}$ $T2 : Rx , T2 : Ry , T1 : Wx , T3 : Wy , T3 : Wz , T2 : Wz , T1 : Rz , T2 : Wy $ ... $1$ Schedule $2$ Schedule $3$ Schedule $4$
Bikram
asked
in
Databases
Aug 26, 2017
by
Bikram
284
views
tbb-dbms-2
databases
transaction-and-concurrency
conflict-serializable
2
votes
1
answer
284
Test by Bikram | Databases | Test 2 | Question: 21
Consider the following transaction involving two bank accounts $A$ and $B$ ... $A$ and $B$ should remain constant is that of: Atomicity Consistency Isolation Durability
Bikram
asked
in
Databases
Aug 26, 2017
by
Bikram
324
views
tbb-dbms-2
databases
transaction-and-concurrency
1
vote
1
answer
285
Test by Bikram | Databases | Test 2 | Question: 19
A schedule with two transactions T1 and T2 is as mentioned below: ... The above schedule is an example of: Cascade-less schedule Recoverable schedule Both Cascade-less and Recoverable schedule Irrecoverable schedule
Bikram
asked
in
Databases
Aug 26, 2017
by
Bikram
303
views
tbb-dbms-2
databases
transaction-and-concurrency
3
votes
2
answers
286
Test by Bikram | Databases | Test 2 | Question: 17
Which of the following is TRUE about the given schedule S? ... is conflict serializable. It is view serializable but not conflict serializable. It is conflict serializable but not view serializable. It is not serializable.
Bikram
asked
in
Databases
Aug 26, 2017
by
Bikram
488
views
tbb-dbms-2
databases
transaction-and-concurrency
serializability
conflict-serializable
view-serializable
0
votes
1
answer
287
Test by Bikram | Databases | Test 2 | Question: 14
Consider the schedule $S = \{R1(A),R2(B),W2(A),W1(A)\}$ Assume that Transaction T1 has started execution before Transaction T2. Which of the following is TRUE in the above case? Allowed under Basic Timestamp ... Allowed under both Basic Timestamp Protocol and Thomas Write Rule. Not allowed under both Basic Timestamp Protocol and Thomas Write Rule.
Bikram
asked
in
Databases
Aug 26, 2017
by
Bikram
365
views
tbb-dbms-2
databases
transaction-and-concurrency
2
votes
1
answer
288
Test by Bikram | Databases | Test 2 | Question: 10
We are using timestamp-based concurrency control, and there are two transactions T1 and T2 with timestamps 100 and 200, respectively. The following schedule is executed in the order shown below using time stamping protocols: ... Basic Timestamp Ordering Protocol and Thomas Write Rule, but is allowed under Multi-version Timestamp Ordering Protocol.
Bikram
asked
in
Databases
Aug 26, 2017
by
Bikram
876
views
tbb-dbms-2
databases
transaction-and-concurrency
3
votes
1
answer
289
Test by Bikram | Databases | Test 2 | Question: 8
Consider the following schedule: ... Which of the following transaction problems is present in the given schedule ? Lost update Dirty Rea Unrepeatable read Both (A) & (B)
Bikram
asked
in
Databases
Aug 26, 2017
by
Bikram
409
views
tbb-dbms-2
databases
transaction-and-concurrency
0
votes
1
answer
290
Test by Bikram | Databases | Test 2 | Question: 3
Consider the following schedule: ... $W(B), W(C)$ $W(A), W(A)$ $W(A) ,W(B)$ $W(C), W(A)$
Bikram
asked
in
Databases
Aug 26, 2017
by
Bikram
670
views
tbb-dbms-2
databases
transaction-and-concurrency
1
vote
2
answers
291
#Transaction-Schedules
How to order these schedules in terms of flexibility of concurrency? 1. View serializable 2. Conflict Serializable 3.Recoverable 4.Strict 5.Cascadeless
Tuhin Dutta
asked
in
Databases
Aug 12, 2017
by
Tuhin Dutta
689
views
databases
transaction-and-concurrency
view-serializable
conflict-serializable
strict-schedule
cascadeless-schedule
recoverable-schedule
4
votes
1
answer
292
Dirty read & unrepeatable read
Where is unrepeatable read and dirty read taking place here?
just_bhavana
asked
in
Databases
Aug 6, 2017
by
just_bhavana
987
views
databases
transaction-and-concurrency
1
vote
1
answer
293
DBMS: CONCURRENCY CONTROL 2 PHASE LOCKING PROTOCOL
T1: r1(x)w1(x)r1(y)w1(y) T2: r2(y)w2(y) L is xclusive lock and U is unlock L1(y)L1(X)R1(Y)W1(Y)R1(X)W1(X)U1(X)U1(Y)L2(Y)R2(Y)W2(Y)U2(Y)? IS THIS SCHEDULE VALID UNDER A 2 PHASE LOCKING SCHEDULER????
Shivam Gupta 3
asked
in
Databases
Aug 3, 2017
by
Shivam Gupta 3
626
views
2phaselocking
transaction-and-concurrency
databases
4
votes
1
answer
294
Transcation And Concurrency control
Consider the following transactions T1:r1(A) w1(A) r1(B) w1(B) T2:r2(B) w2(B) r2(A) w2(A) 1) How many schedules serializable as T1->T2 2) How many schedules serializable as T2->T1
Anshul Shankar
asked
in
Databases
Aug 2, 2017
by
Anshul Shankar
1.7k
views
transaction-and-concurrency
serializability
1
vote
2
answers
295
Graph based protocol
I have been reading about the tree protocol as an approach in locking management in databases. I read that it is deadlock free but I am not sure how it works. Example: Assume that T1 has locked B, D, E in exclusive mode. According to the rules: T2 can lock ... it has to lock D but D is locked by T1 so it has to wait. Hence deadlock. What am I misunderstanding in the algorithm?
shashank023
asked
in
Databases
Jul 25, 2017
by
shashank023
2.8k
views
graph-based-protocol
transaction-and-concurrency
concurrency
databases
4
votes
1
answer
296
conservative two phase locking protocol
Does the conservative two phase locking protocol produce cascadeless schedules? Let us consider the following schedule : Since in the schedule the lock on a is released, it is possible for the transaction T2 to acquire the lock on a. ... Does it mean that even though a conservative two phase protocol is used, the schedules may not necesssarily be cascadeless?
shashank023
asked
in
Databases
Jul 25, 2017
by
shashank023
5.8k
views
two-phase-locking-protocol
transaction-and-concurrency
databases
3
votes
2
answers
297
How to check if a schedule is 2PL or not?
How to check if a schedule is allowed in 2PL or not? S1:R2(A)W1(B)W1(C)R3(B)R2(B)R1(A)R2(C)W3(A) S2:W2(A)W1(A)W3(A)W2(B)W1(B)W3(B)
reena_kandari
asked
in
Databases
Jul 22, 2017
by
reena_kandari
7.4k
views
databases
transaction-and-concurrency
1
vote
0
answers
298
[ DBMS ] AVL and BST
Classify the best balanced tree DS from AVl and B+trees for below applications 1. Main memory application with 100 keys 2. Secondary memory application with 100 keys 3. Main memory application with 1 million keys 4. Secondary memory application with 1 million keys
rahul sharma 5
asked
in
Databases
Jul 15, 2017
by
rahul sharma 5
185
views
databases
transaction-and-concurrency
1
vote
1
answer
299
[DBMS] Lost Update and WW
Consider thw following schedules :- S1 :- W1(A) W2(A) W1(B) W2(B) S2:- W1(A) R2(A) W2(A) W2(B) W1(B) Assume that schedule S1 is failed after performing W1(B). Which of the following options are true? a.) S1 and S2 has lost update ... lost update problem and WW problem c) S1 has WW problem and S2 has lost update problem d) S1 has lost update problem and s2 has WW problem
rahul sharma 5
asked
in
Databases
Jul 15, 2017
by
rahul sharma 5
1.4k
views
databases
transaction-and-concurrency
2
votes
0
answers
300
[DBMS] Conflicting pairs
True / false? 1. Serial schedules don't have any conflicting pairs. 2. Serializable schedules don't have any conflicting pairs
rahul sharma 5
asked
in
Databases
Jul 15, 2017
by
rahul sharma 5
476
views
databases
transaction-and-concurrency
Page:
« prev
1
...
5
6
7
8
9
10
11
12
13
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:...