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

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. The degree of the PROJECT operation is equal to

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. Consider two tuples A and B, the operation whose result includes tuples that are included in both relations is classified as

View solution

Q. The operation which is used to select the subset of tuples by satisfying the selection constraint and the selection is made from relation is classified as

View solution

Q. The value of the atom which evaluates either condition is TRUE or FALSE for particular combination of tuples is classified as

View solution

Q. The representation of relational calculus internal queries is classified as

View solution

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

View solution