adplus-dvertising
frame-decoration

Question

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

a.

FULL UNION operation

b.

JOIN UNION operation

c.

OUTER UNION operation

d.

INNER UNION operation

Posted under DBMS

Answer: (c).OUTER UNION operation

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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

Q. Consider two tuples X and Y, the operation whose result includes tuples that are only in X but not in Y is classified as

Q. As compared to Cartesian product, the tuples which appears in the result by applying JOIN are the ones

Q. Consider two tuples R and S, the maximum size of R and S relations is divided to expected size of join is classified as

Q. In the notation for query trees, the node which is used to terminate the execution is classified as

Q. The expression used in relational calculus to specify request of retrieval is classified as

Q. The compatibility condition which states that the relations for union and intersection operations must consist of same type of tuples is classified as

Q. If the common attributes of two relations are classified as join attributes then the OUTER UNION must be equal to

Q. The degree of the PROJECT operation is equal to

Q. The operations used to combine multiple relations to present information in single table are classified as

Q. In the notation for query graphs, the single circles are used to represent

Q. The JOIN operation in which only equality operator is used is classified as

Q. In relational calculus, the expression which does not guarantees finite number of tuples is classified as

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

Q. The JOIN operation in which two attributes joined have same name in both relations is classified as