Suppose Now That Rab And Sab Are Two Relations With R And S #550
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:</p> <pre><code class="language-text"> R intersect S;</code></pre> <p>Then which of the following is the most restrictive, correct condition on the value of m?
This multiple choice question (MCQ) is related to the book/course
gs gs117 Database Management System.
It can also be found in
gs gs117 Normalization in Database Management System - Functional-Dependency Theory - Quiz No.1.
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?
m = min(r,s)
0 <= m <= r + s
min(r,s) <= m <= max(r,s)
0 <= m <= min(r,s)
Similar question(s) are as followings:
Online Quizzes of gs117 Database Management System
Indexing and Hashing - Bitmap Indices - Quiz No.1
gs gs117 Database Management System
Online Quizzes
