adplus-dvertising
frame-decoration

Question

The constraints that are applied on individual tuples and are verified whenever any tuple is modified or new tuple is inserted are called

a.

language based constraints

b.

tuple based constraints

c.

scale based constraints

d.

precision based constraints

Posted under Relational Databases DBMS

Answer: (b).tuple based constraints

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The constraints that are applied on individual tuples and are verified whenever any tuple is modified or new tuple is inserted are called

Similar Questions

Discover Related MCQs

Q. The conclusion of the template is a condition which must be held on tuples hypothesis in the template dependency called

Q. The type of algorithm in which decomposition of relation schema is constructed from other specific set of functional dependencies is classified as

Q. The decomposition of one relation say R into two relations is classified as

Q. The types of template dependencies are

Q. The other name of project-join normal form is

Q. The template conclusion is a set of tuples that must be included in the relations in the template dependency called

Q. The inclusion dependencies that are preceding are used to represent

Q. The tuples that are represented in one of two relations and are lost if the JOIN operation is performed are called

Q. The normal form which consider all the types of constraints and dependencies is classified as

Q. The constraint violated when key value in tuple already exists in some other relation's tuple is called

Q. The definition of relation in which values and attributes are ordered in tuple is 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 values which cannot be divided further are 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 state in which the database does not follow integrity constraints is classified as

Q. The tuples in relation are sensitive to

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

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

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

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