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?

Related Questions

• Which one of the following provides the ability to query information from the database and to insert tuples into, delete tuples from, and modify tuples in the database?
• Which SQL function is used to count the number of rows in a SQL query?
• Relational Algebra is a                      query language that takes two relations as input and produces another relation as an output of the query.
• Relational Algebra is a __________ query language that takes two relations as input and produces another relation as an output of the query.
• The result which operation contains all pairs of tuples from the two relations, regardless of whether their attribute values match.
• A                  on an attribute of a relation is a data structure that allows the database system to find those tuples in the relation that have a specified value for that attribute efficiently, without scanning through all the tuples of the relation.
• In a                            operations do not wait for requests to produce tuples, but instead generate the tuples eagerly.
• Any recursive view must be defined as the union of two subqueries: a                query that is nonrecursive and a                      query.
•                  dump, writes out SQL DDL statements and SQL insert statements to a file, which can then be reexecuted to re- create the database.
• Which of the following SQL clauses is used to DELETE tuples from a database table?