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

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