| 111. | The tuples that are represented in one of two relations and are lost if the JOIN operation is performed are called |
|
Answer: (b).dangling tuples
|
| 112. | The inclusion dependencies that are preceding are used to represent |
|
Answer: (c).referential integrity constraint
|
| 113. | The template conclusion is a set of tuples that must be included in the relations in the template dependency called |
|
Answer: (b).tuple generating templates
|
| 114. | The other name of project-join normal form is |
|
Answer: (d).fifth normal form
|
| 115. | The types of template dependencies are |
|
Answer: (d).both a and b
|
| 116. | The decomposition of one relation say R into two relations is classified as |
|
Answer: (c).binary decomposition
|
| 117. | The type of algorithm in which decomposition of relation schema is constructed from other specific set of functional dependencies is classified as |
|
Answer: (a).relational synthesis algorithm
|
| 118. | The conclusion of the template is a condition which must be held on tuples hypothesis in the template dependency called |
|
Answer: (c).constraint generating templates
|
| 119. | The constraints that are applied on individual tuples and are verified whenever any tuple is modified or new tuple is inserted are called |
|
Answer: (b).tuple based constraints
|
