adplus-dvertising
frame-decoration

Question

Consider the join of a relation R with relation S. If R has m tuples and S has n tuples, then the maximum size of join is:

a.

mn

b.

m+n

c.

(m+n)/2

d.

2(m+n)

Posted under Relational Algebra DBMS

Answer: (a).mn

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Consider the join of a relation R with relation S. If R has m tuples and S has n tuples, then the maximum size of join is:

Similar Questions

Discover Related MCQs

Q. The natural join is equal to :

Q. In unary relational operations, the SELECT operation is partition of relation usually classified as

Q. The operators in SELECT operation statement such as 'and' , 'or' and 'not' are classified as

Q. If in the JOIN operation, the conditions of JOIN operation are not satisfied then the results of the operation is

Q. Because of the calculus expression, the relational calculus is considered as

Q. The DIVISION operation can be applied to two relations A and B such as R(A) ÷ R(B) where as

Q. In the EQUIJOIN condition, the operation which is used to avoid superfluous attribute is classified as

Q. The Boolean expression used in the SELECT operation consists of clauses such as

Q. The types of binary operations includes

Q. In the notation for query graphs, the double ovals or circles are used to represent

Q. The operation which allows to process relationships from multiple relations rather than single relation is classified as

Q. The branch of calculus which is based on mathematical logic is classified as

Q. In a query tree, the operations of relational algebra are classified as

Q. The operation which is used to take union of tuples from the relations that are not union compatible is classified as

Q. If matching tuples are not found, the kind of OUTER JOIN operation which keeps all the tuples of first and second relation is classified as

Q. The operations which are used to enhance the power of expression of relational algebra includes

Q. In the relational calculus, the variables are bounded with the help of

Q. In unary relational operations, the symbols such as equal to, less than and greater than are classified as

Q. The JOIN operation which uses any of the comparison operators is classified as

Q. The kind of operation by which one tuple can be created with the help of combining tuples from two relations is classified as