Q. The operator which is useful for a single relation is classified as

View solution

Q. The types of quantifiers are

View solution

Q. The single relational algebra expression can be used in sequence of operations by

View solution

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

View solution

Q. The data structure in the form of tree to correspond to relational algebra expression is classified as

View solution

Q. The types of relational calculi includes

View solution

Q. If the duplicate relations will not be eliminated, the resultant tuples will be multiset of tuples rather than

View solution

Q. The SELECT operation is performed on

View solution

Q. The selection condition of SELECT operator is considered as

View solution

Q. The type of JOIN operation through which one can keep all tuples in relations without considering corresponding tuples in any other relation is classified as

View solution

Q. The process in which tuple is created by having combined attributes from two relations is classified as

View solution

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

View solution

Q. In relational operations, the SELECT operation is written as

View solution

Q. The nodes which represents queries in the relations are classified as

View solution

Q. In unary relational operations, the symbol π is used to represent the operation called

View solution

Q. The relational calculus is classified as

View solution

Q. The kind of operation which is used to extend the traditional projection operation by including projection attributes in projection list is called

View solution

Q. The expression of generalized projection can be written as

View solution

Q. The expression which specifies the procedure to retrieve rather than retrieval content is classified as

View solution

Q. In a query tree, the input relations of query are classified as

View solution