637 views

1 Answer

2 2 votes

Option A is ans (plz keep patience and read below)

Isolation level:-degree to which one transaction must be isolated from resource or data modifications made by other transactions.

Lower isolation level :-- It increases the ability of many users to access data at the same time, but increases the number of concurrency effects (such as dirty reads or lost updates) users might encounter.

i.e.read uncommitted, may retrieve data that has been modified but not committed by other transactions. All of the concurrency side effects can happen in read uncommitted, but there is no read locking or versioning, so overhead is minimized.

Higher isolation level :- It reduces the types of concurrency effects that users may encounter, but requires more system resources and increases the chances that one transaction will block another. 

i.e.Serializable, guarantees that a transaction will retrieve exactly the same data every time it repeats a read operation, but it does this by performing a level of locking that is likely to impact other users in multi-user systems. 

Now  ISO standard defines following isolation levels:-

1.Read uncommitted (the lowest level where transactions are isolated only enough to ensure that physically corrupt data is not read)

2.Read committed (Database Engine default level)

3.Repeatable read

4.Serializable (the highest level, where transactions are completely isolated from one another)

https://technet.microsoft.com/en-us/library/ms189122(v=sql.105).aspx

• edited by
Position:
Show:

Related questions

9 9 votes
5 answers 5 answers
9.9k
9.9k views
Misbah Ghaya asked May 2, 2016
9,883 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,637 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.9k
10.9k views
Misbah Ghaya asked Apr 27, 2016
10,911 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
9.0k
9.0k views
Misbah Ghaya asked Apr 26, 2016
8,987 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...