原创力文档- 1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
- 2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
查看更多
Exercise 3.1.1
Answers for this exercise may vary because of different interpretations.
Some possible FDs:
Social Security number name
Area code state
Street address, city, state zipcode
Possible keys:
{Social Security number, street address, city, state, area code, phone number}
Need street address, city, state to uniquely determine location. A person could have multiple addresses. The same is true for phones. These days, a person could have a landline and a cellular phone
Exercise 3.1.2
Answers for this exercise may vary because of different interpretations
Some possible FDs:
ID x-position, y-position, z-position
ID x-velocity, y-velocity, z-velocity
x-position, y-position, z-position ID
Possible keys:
{ID}
{x-position, y-position, z-position}
The reason why the positions would be a key is no two molecules can occupy the same point.
Exercise 3.1.3a
The superkeys are any subset that contains A
. Thus, there are 2
(n-1)
such subsets, since
1
each of the n-1 attributes A
2 through A
n may independently be chosen in or out.
Exercise 3.1.3b
The superkeys are any subset that contains A
1 or A
2. There are 2
(n-1)
such subsets when
considering A
1
and the n-1 attributes A
2
through A
n. There are 2
(n-2)
such subsets when
considering A
2
and the n-2 attributes A
3
through A
n. We do not count A
1 in these subsets
because they are already counted in the first group of subsets. The total number of
subsets is 2
(n-1)
+ 2 (n-2) .
Exercise 3.1.3c
The superkeys are any subset that contains {A
,A } or {A
,A
4
}. There are 2
(n-2)
such subsets
1
2
3
when considering {A
1
2
3
n
(n-2)
– 2
(n-4)
such
,A } and the n-2 attributes A
through A . There are 2
subsets when considering {A
3,A 4} and attributes A
5
through A n along with the individual
attributes A
1
and A
2
(n-4)
term because we have to discard the subsets that
. We get the 2
(n-2) +
contain the key {A
1,A 2} to avoid double counting. The total number of subsets is 2
2(n-2) – 2 (n-4) .
Exercise 3.1.3d
The superkeys
文档评论（0）