menu
search
Log In
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

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Self Doubt: Is this schedule conflict Serializable?

2 votes
190 views

My question, does abort in T2 makes this schedule conflict serializable? as the effect of  T2 will be null. 

T1: Rx T2: Wx T1: Wx T2: ABORT T1: COMMIT

Rx – read item x.

Wx – write item x. 

in Databases 190 views
0
yes! of course

Please log in or register to answer this question.

← Prev. Next →
← Prev. Qn. in Sub. Next Qn. in Sub. →

Related questions

7 votes
3 answers
2
1k views
view serializable
$S: R_1(A),R_2(B),W_2(A),W_3(C),R_4(C),R_3(A),W_3(B),R_4(A),W_2(B),W_4(B),W_3(A)$ View serializable or not?
$S: R_1(A),R_2(B),W_2(A),W_3(C),R_4(C),R_3(A),W_3(B),R_4(A),W_2(B),W_4(B),W_3(A)$ View serializable or not?
asked Jan 28, 2017 in Databases Supremo 1k views
1 vote
1 answer
3
334 views
Conflict + View + Concurrency
Do they all ensure serializability??? Strict 2PL Rigirous 2PL Conservative 2PL Multiversion 2PL Timestamp Stirct timestamp Multiversion timestamp Graph based protocol Thomas write rule Multiple granuality And among them which policy allows schedules that are not conflict serializable by are view serializable???
Do they all ensure serializability??? Strict 2PL Rigirous 2PL Conservative 2PL Multiversion 2PL Timestamp Stirct timestamp Multiversion timestamp Graph based protocol Thomas write rule Multiple granuality And among them which policy allows schedules that are not conflict serializable by are view serializable???
asked Oct 22, 2016 in Databases Rahul Jain25 334 views
1 vote
3 answers
4
1.2k views
VIEW SERIALIZABILITY
Consider the 2 transactions T1: R(A) W(A) W(B) T2: R(A) W(A) R(B) W(B) How many view serializable schedules are possible which are not conflict serializable? (A) 0 (B) 1 (C) 2 (D) 3
Consider the 2 transactions T1: R(A) W(A) W(B) T2: R(A) W(A) R(B) W(B) How many view serializable schedules are possible which are not conflict serializable? (A) 0 (B) 1 (C) 2 (D) 3
asked Dec 6, 2017 in Databases shivangi5 1.2k views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...