adplus-dvertising
frame-decoration

Question

The representation of relational calculus internal queries is classified as

a.

structural graph

b.

nodes graph

c.

query graph

d.

functional graph

Posted under DBMS

Answer: (c).query graph

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The representation of relational calculus internal queries 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 second relation out of the two relations is classified as

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

Q. The operation which only selects some of the columns from table and neglect the remaining columns is classified as

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

Q. The types of quantifiers are

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

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

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

Q. The types of relational calculi includes

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

Q. The SELECT operation is performed on

Q. The selection condition of SELECT operator is considered as

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

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

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

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

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

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

Q. The relational calculus is classified as

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