Question

Which transaction isolation level permits non-repeatable reads and phantom reads while still guaranteeing that dirty reads never occur?

Q: Answer-Which transaction isolation level permits non-repeatable reads and phantom reads while still guarant...

Read Committed guarantees a transaction only ever reads data that has been committed no dirty reads, but because each statement re-reads current committed data, a value read twice within the same transaction can change non-repeatable read and new rows matching a querys predicate can appear phantom read between reads.

A Read Uncommitted — permits dirty, non-repeatable, and phantom reads

B Read Committed — prevents dirty reads but still allows non-repeatable and phantom reads

C Repeatable Read — prevents dirty and non-repeatable reads but may still allow phantom reads

D Serializable — prevents dirty reads, non-repeatable reads, and phantom reads entirely

E Snapshot Isolation — prevents all three anomalies using multi-version concurrency control

Practice Next

More IT DBMS Questions

Multiple transactions execute concurrently on a database, yet each transaction behaves as though it is the only one running, and is shielded from seeing an...
Wait-Die and Wound-Wait are strategies for:
Which B+ tree characteristic is particularly useful for a range query such as salary BETWEEN 50000 AND 70000?
Transaction T1 updates a row but has not yet committed. Transaction T2 then reads this updated but uncommitted value. If T1 subsequently rolls back, what p...
A relation is decomposed into R1(A,B) and R2(B,C). Which condition guarantees a lossless join for a binary decomposition?
You have a Python list of fruits and want to extract a specific sub-list using slicing. Complete the missing part of the code to obtain the sub-list `['b...
Query optimization heuristics often include:
A relation Student_Course(StudentID, CourseID, StudentName, CourseName) stores StudentName redundantly in every row for each course a given student takes. ...
Shadow Paging avoids:
A relation R(P, Q, R, S) has functional dependencies PQ -> R, R -> S, and S -> P. How many candidate keys does this relation have?

Hey! Ask a query

🎓

Think You're Ready for RBI Grade B?

RBI Grade B 2026 Phase 1 Memory Based Paper

200 Questions with Detailed Solutions
Section-wise Coverage (GA, English, Quant & Reasoning)

Download Now 100% Free PDF

Which transaction isolation level permits non-repeatable reads and phantom reads while still guaranteeing that dirty reads never occur?

Detailed Solution

More IT DBMS Questions

Hey! Ask a query

Please Register/Login

RBI Grade B 2026 Phase 1 Memory Based Paper