adplus-dvertising
frame-decoration

Question

The type of constraint in which value of each attribute (X) must be an indivisible value from domain (X) is classified as

a.

explicit constraint

b.

implicit constraint

c.

domain constraint

d.

range constraint

Posted under Relational Databases DBMS

Answer: (c).domain constraint

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The type of constraint in which value of each attribute (X) must be an indivisible value from domain (X) is classified as

Similar Questions

Discover Related MCQs

Q. The constraints which deals with the changes in the database are classified as

Q. The multivalued dependencies used to develop relational design theory of database is classified as

Q. In the data model schemas, the constraints that are expressed directly are classified as

Q. In relational database schemas, the transition constraints are also known as

Q. A row of table in relational model terminology is classified as

Q. The constraint which is used to specify the consistency in two or more relations among tuples is classified as

Q. The ordered list of all the n-values is classified as

Q. The state in which the database follows all the integrity constraints is classified as

Q. The column header of table in relational model terminology is classified as

Q. The operation which violates only one constraint called referential integrity when it is performed is called

Q. The distribution in which each row denote some related values collection is classified as

Q. When the foreign key refers to a tuple which does not exists in subjected relation then the constraint violated is

Q. The basic operations that can be performed on relations are

Q. In relational database schemas, the state constraints are also known as

Q. The tuples in relation are sensitive to

Q. The state in which the database does not follow integrity constraints is classified as

Q. The type of constraint which states that not even a single value with primary key can be a null value is classified as

Q. The values which cannot be divided further are classified as

Q. On a relational database, the kind of constraint which must be specified and does not contain large classes of constraints is considered as

Q. The definition of relation in which values and attributes are ordered in tuple is classified as