adplus-dvertising
frame-decoration

Question

In the data model schemas, the constraints that are can not be expressed directly are classified as

a.

application based constraints

b.

semantic constraints

c.

business rules

d.

all of above

Posted under Relational Databases DBMS

Answer: (d).all of above

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

Q. The cardinality in relational data model is considered as

Q. The constraint violated when the given value of attribute is not included in the corresponding domain is

Q. If two or more constraints are violated by using insert operation then by default the

Q. In the data model, the inherent constraints are classified as

Q. The multi-valued dependencies and functional dependencies are classified as category of

Q. The model in which the multi-valued and composite attributes is considered as

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

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