Transactions and Concurrency Control GATE 1993 Question #8778 with Solution

GATE 1993

Database ManagementTransactions and Concurrency ControleasyMCQ1 mark

A schedule S is defined as a view serializable schedule if:

AIt is view equivalent to some serial scheduleBIt has no blind writesCIts precedence graph has no directed cyclesDIt is strict and cascadeless

Related Database Management PYQs

Consider relation R(A, B, C, D) with functional dependencies F = {A -> B, B -> C, C -> D}. What is the closure of attribute A (A+)…

If a relation schema is in 3NF and every candidate key is a single attribute (simple candidate key), then the relation is guarante…

In SQL, what is the effect of using the DISTINCT keyword in a SELECT clause?

Two operations in a schedule are said to conflict if they belong to different transactions, access the exact same data item, and:

Cascading rollback occurs in a schedule when:

Let P, Q, R and S be the attributes of a relation in a relational schema. Let X → Y indicate functional dependency in the context …

Saved progressKeep answers, mock results and completion history across devices.

Adaptive practiceGet questions matched to your recent accuracy and difficulty level.

Bookmarks and notesBuild a personal revision list and record why a question was difficult.

Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.