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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. The types of template dependencies are

View solution

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

View solution

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

View solution

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

View solution

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

View solution