Data structure in form of tree to correspond to relational algebra exp – McqOptions

MCQOPTIONS

1.	Data structure in form of tree to correspond to relational algebra expression is classified as
A.	Relation tree
B.	Attribute tree
C.	Entity tree
D.	Query tree
Answer» E.

Discussion

No Comment Found

Related MCQs

In unary relational operations, SELECT operation is partition of relation usually classified as
If in JOIN operation, conditions of JOIN operation are not satisfied then results of operation is
Because of calculus expression, relational calculus is considered as
DIVISION operation can be applied to two relations A and B such as R(A) R(B) where as
In EQUIJOIN condition, operation which is used to avoid superfluous attribute is classified as
Boolean expression used in SELECT operation consists of clauses such as
Types of binary operations includes
In unary relational operations, PROJECT operation is partition of relation usually classified as
JOIN operation in which two attributes joined have same name in both relations is classified as
Consider two tuples A and B, operation whose result includes tuples that are included in both relations is classified as