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 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:

Add Comment

Similar Questions

Discover Related MCQs

Q. The natural join is equal to :

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. The types of binary operations includes

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

View All MCQs on DBMS

Suggested Topics

Are you eager to expand your knowledge beyond DBMS? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Systems Analysis and Design Methods

Get familiar with the process of designing and improving business systems with our...

Software Architecture and Design

Get a strong hold on the blueprint of software systems with our Software Architecture...

Neural Networks

Dive into the world of Artificial Intelligence with our Neural Networks MCQs. Uncover...

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

MySQL Database

Enhance your knowledge of relational databases with our MySQL MCQs. Understand...

Visual Basic

Enhance your knowledge of Microsoft's event-driven programming language with our...

Software Engineering

Learn about the systematic approach to developing software with our Software...

MongoDB

Learn the leading NoSQL database with our MongoDB MCQs. Understand everything from...

HTML

Start your journey in web development with our HTML MCQs. Learn the building blocks...