Can a key be the set of all attributes if there is at least one nontrivial FD in a schema?
What will be an ideal response?
```
No. Suppose a key k contained all attributes and there is a non-trivial FD X ? Y . k contains X and Y . But the FD implies that X determines Y . Hence we can delete Y ? (X ? Y )fromk and the remaining attributes still form a key. This means that k was not minimal, a contradiction.
```
You might also like to view...
What type of attack does a remote-access Trojan attempt to perpetrate?
A. worm B. back door C. remote denial of service D. composite attack
Multiple-choice: Choose the correct HTML tag to make a text italic
a.
b.
The President's Working Group on Unlawful Conduct on the Internet suggested developing mechanisms for tracing online offenders
Indicate whether the statement is true or false.
What does adding an entry to a sorted list require?
What will be an ideal response?