| 111. | The tuples that are represented in one of two relations and are lost if the JOIN operation is performed are called |
| a. | functional tuples |
| b. | dangling tuples |
| c. | algorithm tuples |
| d. | decomposition tuples |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (b).dangling tuples
|
| 112. | The inclusion dependencies that are preceding are used to represent |
| a. | algorithmic constraint |
| b. | trivial constraint |
| c. | referential integrity constraint |
| d. | decomposition constraint |
| View Answer Report Discuss Too Difficult! Search Google |
|
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 |
| a. | constraint generating templates |
| b. | tuple generating templates |
| c. | schema generating templates |
| d. | relation filtering template |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (b).tuple generating templates
|
| 114. | The other name of project-join normal form is |
| a. | join normal form |
| b. | trivial normal form |
| c. | sixth normal form |
| d. | fifth normal form |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (d).fifth normal form
|
| 115. | The types of template dependencies are |
| a. | constraint generating templates |
| b. | tuple generating templates |
| c. | schema generating templates |
| d. | both a and b |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (d).both a and b
|
| 116. | The decomposition of one relation say R into two relations is classified as |
| a. | functional decomposition |
| b. | ternary decomposition |
| c. | binary decomposition |
| d. | ordinary decomposition |
| View Answer Report Discuss Too Difficult! Search Google |
|
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 |
| a. | relational synthesis algorithm |
| b. | decomposition algorithm |
| c. | schema synthesis algorithm |
| d. | none of above |
| View Answer Report Discuss Too Difficult! Search Google |
|
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 |
| a. | schema generating templates |
| b. | relation filtering template |
| c. | constraint generating templates |
| d. | tuple generating templates |
| View Answer Report Discuss Too Difficult! Search Google |
|
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 |
| a. | language based constraints |
| b. | tuple based constraints |
| c. | scale based constraints |
| d. | precision based constraints |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (b).tuple based constraints
|
