GATE CSE: Databases

Question 1 of 10

A relation in BCNF is always also in:

Question 2 of 10

R(A, B, C) with functional dependencies A → B and B → C. What is the candidate key?

Question 3 of 10

Which of these is NOT one of the ACID properties?

Question 4 of 10

Conflict serializability of a schedule is tested by:

Question 5 of 10

Two-phase locking (2PL) guarantees:

Question 6 of 10

In a B+ tree, the data records (or pointers to them) are kept:

Question 7 of 10

How does COUNT(column) differ from COUNT(*)?

Question 8 of 10

The natural join of R(A, B) and S(B, C) matches rows on:

Question 9 of 10

Decomposing R into R1 and R2 is lossless exactly when:

Question 10 of 10

A schedule in which every transaction reads only values written by committed transactions is: