GATE 2008
In multi-granularity locking, before a transaction can obtain a Shared (S) lock on an individual record node in a database tree, it must acquire which lock on all its ancestor table/file nodes?
Related Database Management PYQs
Which of the following concurrency control protocols ensures conflict serializability and avoids cascading rollbacks, but does NOT…
A relation is in Third Normal Form (3NF) if and only if for every non-trivial functional dependency X -> Y:
A dense index on a database file contains:
Given relations R(A, B) and S(B, C), which of the following is equivalent to the set difference operation R - S (assuming R and S …
A directed graph where vertices represent active transactions and directed edges (Ti -> Tj) represent that Ti is waiting for a res…
Lossless-join decomposition of a relational schema R into R1 and R2 is guaranteed if and only if:
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
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.