8,921 views

3 Answers

Best answer
23 23 votes

Answer is Serializable ---Highest isolation level and Lowest one is Read Uncommitted 

The Isolation level are defined for transaction :

We will see what violation can happen with each isolation level : violation are Dirty read , Non repeatable read, Phantom .

The first one is Read Uncommitted : So here Dirty read , Non repeatable read, Phantom . all are possible  

The second One is  Read Committed : It reads the data after the another transaction is committed But it doesnt guarantee That the next time it will read the same data value then it will get same old value .. Dirty read--Not possible  , Non repeatable read--Possible , Phantom-- Possible .

Third one : Repeated Read : : It reads the data after the another transaction is committed But it  guarantee That the next time it will read the same data value then it will get same old value .. Dirty read--Not possible  , Non repeatable read--not possible, Phantom-- Possible .

Fourth One is : Serializable : It is highest and toughest isolation level . It will give always Consistent result . It would have schedules equivalent to Serial Schedules .Dirty read--Not possible  , Non repeatable read--Possible , Phantom-- Not Possible .

 .

selected by
2 2 votes
c) Committed read

Isolation is for concurrency management of DBMS.

And concurrency control violates serializability

https://vladmihalcea.com/2014/12/23/a-beginners-guide-to-transaction-isolation-levels-in-enterprise-java/

Am I correct?
edited by
Answer:
Position:
Show:

Related questions

9 9 votes
5 answers 5 answers
9.8k
9.8k views
Misbah Ghaya asked May 2, 2016
9,777 views
Embedded pointer providesA secondary access pathA physical record keyAn inverted indexA primary key
9 9 votes
2 answers 2 answers
6.6k
6.6k views
Misbah Ghaya asked Apr 27, 2016
6,584 views
The physical location of a record determined by a formula that transforms a file key into a record location isHashed file$B$-Tree fileIndexed fileSequential file
9 9 votes
2 answers 2 answers
10.8k
10.8k views
Misbah Ghaya asked Apr 27, 2016
10,802 views
Calculate the order of leaf ($P_{leaf}$) and non leaf (P) nodes of a $B^{+}$ tree based on the information given below.Search key field = $12$ fieldRecord pointer = $10$ ...
11 11 votes
1 answers 1 answer
8.9k
8.9k views
Misbah Ghaya asked Apr 26, 2016
8,900 views
Consider the following dependencies and the BOOK table in a relational database design. Determine the normal form of the given relation.ISBN $\rightarrow$ TitleISBN $\rig...