1. Computer Science Engineering (CSE)
  2. DataBase Management System (DBMS)
  3. Relational Database Design
  4. Suppose now that R(A,B:) and S(A,B:) are...

Suppose now that R(A,B:) and S(A,B:) are two relations with r and s tuples, respectively
(again, not necessarily distinct). If m is the number of (not necessarily distinct) tuples in the
result of the SQL query: R intersect S; Then which of the following is the most restrictive, correct condition on the value of m?

A. m = min(r,s)
B. 0 <= m <= r + s
C. min(r,s) <= m <= max(r,s)
D. 0 <= m <= min(r,s)
Answer» D. 0 <= m <= min(r,s)