The following functional dependencies hold for relations R(A, B, C) and S(B, D, E): $$$\eqalign{ & B \to A \cr & A \to C \cr} $$$

The relation R contains 200 tuples and the relation S contains 100 tuples. What is the maximum number of tuples possible in the natural join R $$\Join$$ S?

Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?

I. 2-phase locking
II. Time-stamp ordering

Consider the following schedule for transactions T1, T2 and T3: Which one of the schedules below is the correct serialization of the above?

Consider a B⁺- tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in any non-root node?