The Gateway to Computer Science Excellence
0 votes
71 views

Q50. how many statements is true

  1. unrepeatable read also know as read write conflict
  2. Strict 2PL may have read write conflict 

1st one given as true now my doubt is we know that read write conflict that is https://www.revolvy.com/page/Read%E2%80%93write-conflict and we also know unrepeatable read https://www.youtube.com/watch?v=mLNfpqybSZM .

how we can call unrepeatable read as read write conflict


2nd one given as false but i think it is true

in Databases by Boss (10.6k points)
edited by | 71 views
0
Any transaction written in 2PL format will be conflict serializable. because it is conflict serializable we do not have read-write conflict.

and yes unrepeatable read is also known as read write problem/conflict.

Please log in or register to answer this question.

Related questions

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
50,737 questions
57,365 answers
198,494 comments
105,260 users