Similar Collections

.

questions

Title
The basic operations that can be performed on relations are
In relational database schemas, the state constraints are also known as
The tuples in relation are sensitive to
The state in which the database does not follow integrity constraints is classified as
The type of constraint which states that not even a single value with primary key can be a null value is classified as
The values which cannot be divided further are classified as
On a relational database, the kind of constraint which must be specified and does not contain large classes of constraints is considered as
The definition of relation in which values and attributes are ordered in tuple is classified as
The constraint violated when key value in tuple already exists in some other relation's tuple is called
The normal form which consider all the types of constraints and dependencies is classified as
The tuples that are represented in one of two relations and are lost if the JOIN operation is performed are called
The inclusion dependencies that are preceding are used to represent
The template conclusion is a set of tuples that must be included in the relations in the template dependency called
The other name of project-join normal form is
The types of template dependencies are
The decomposition of one relation say R into two relations is classified as
The type of algorithm in which decomposition of relation schema is constructed from other specific set of functional dependencies is classified as
The conclusion of the template is a condition which must be held on tuples hypothesis in the template dependency called
The constraints that are applied on individual tuples and are verified whenever any tuple is modified or new tuple is inserted are called
total questions: 119

Questions

119

Views

1621

Best Answers

299

Points

5