数据库系统基础教程第三章答案(共31页).doc

《数据库系统基础教程第三章答案(共31页).doc》由会员分享，可在线阅读，更多相关《数据库系统基础教程第三章答案(共31页).doc（31页珍藏版）》请在淘文阁 - 分享文档赚钱的网站上搜索。

1、精选优质文档-倾情为你奉上Exercise 3.1.1Answers for this exercise may vary because of different interpretations.Some possible FDs:Social Security number nameArea code stateStreet address, city, state zipcodePossible keys:Social Security number, street address, city, state, area code, phone numberNeed street addr

2、ess, 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 phoneExercise 3.1.2Answers for this exercise may vary because of different interpretationsSome possible FDs:ID x-position, y

3、-position, z-positionID x-velocity, y-velocity, z-velocityx-position, y-position, z-position IDPossible keys:IDx-position, y-position, z-positionThe reason why the positions would be a key is no two molecules can occupy the same point.Exercise 3.1.3aThe superkeys are any subset that contains A1. Thu

4、s, there are 2(n-1) such subsets, since each of the n-1 attributes A2 through An may independently be chosen in or out.Exercise 3.1.3bThe superkeys are any subset that contains A1 or A2. There are 2(n-1) such subsets when considering A1 and the n-1 attributes A2 through An. There are 2(n-2) such sub

5、sets when considering A2 and the n-2 attributes A3 through An. We do not count A1 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.3cThe superkeys are any subset that contains A1,A2 or A3,A4. There are 2(n-2)

6、 such subsets when considering A1,A2 and the n-2 attributes A3 through An. There are 2(n-2) 2(n-4) such subsets when considering A3,A4 and attributes A5 through An along with the individual attributes A1 and A2. We get the 2(n-4) term because we have to discard the subsets that contain the key A1,A2

7、 to avoid double counting. The total number of subsets is 2(n-2) + 2(n-2) 2(n-4).Exercise 3.1.3dThe superkeys are any subset that contains A1,A2 or A1,A3. There are 2(n-2) such subsets when considering A1,A2 and the n-2 attributes A3 through An. There are 2(n-3) such subsets when considering A1,A3 a

8、nd the n-3 attributes A4 through An We do not count A2 in these subsets because they are already counted in the first group of subsets. The total number of subsets is 2(n-2) + 2(n-3).Exercise 3.2.1aWe could try inference rules to deduce new dependencies until we are satisfied we have them all. A mor

9、e systematic way is to consider the closures of all 15 nonempty sets of attributes. For the single attributes we have A+ = A, B+ = B, C+ = ACD, and D+ = AD. Thus, the only new dependency we get with a single attribute on the left is CA.Now consider pairs of attributes: AB+ = ABCD, so we get new depe

10、ndency ABD. AC+ = ACD, and ACD is nontrivial. AD+ = AD, so nothing new. BC+ = ABCD, so we get BCA, and BCD. BD+ = ABCD, giving us BDA and BDC. CD+ = ACD, giving CDA.For the triples of attributes, ACD+ = ACD, but the closures of the other sets are each ABCD. Thus, we get new dependencies ABCD, ABDC,

11、and BCDA.Since ABCD+ = ABCD, we get no new dependencies.The collection of 11 new dependencies mentioned above are: CA, ABD, ACD, BCA, BCD, BDA, BDC, CDA, ABCD, ABDC, and BCDA. Exercise 3.2.1bFrom the analysis of closures above, we find that AB, BC, and BD are keys. All other sets either do not have

12、ABCD as the closure or contain one of these three sets.Exercise 3.2.1cThe superkeys are all those that contain one of those three keys. That is, a superkey that is not a key must contain B and more than one of A, C, and D. Thus, the (proper) superkeys are ABC, ABD, BCD, and ABCD.Exercise 3.2.2ai) Fo

13、r the single attributes we have A+ = ABCD, B+ = BCD, C+ = C, and D+ = D. Thus, the new dependencies are AC and AD.Now consider pairs of attributes: AB+ = ABCD, AC+ = ABCD, AD+ = ABCD, BC+ = BCD, BD+ = BCD, CD+ = CD. Thus the new dependencies are ABC, ABD, ACB, ACD, ADB, ADC, BCD and BDC.For the trip

14、les of attributes, BCD+ = BCD, but the closures of the other sets are each ABCD. Thus, we get new dependencies ABCD, ABDC, and ACDB.Since ABCD+ = ABCD, we get no new dependencies.The collection of 13 new dependencies mentioned above are: AC, AD, ABC, ABD, ACB, ACD, ADB, ADC, BCD, BDC, ABCD, ABDC and

15、 ACDB.ii) For the single attributes we have A+ = A, B+ = B, C+ = C, and D+ = D. Thus, there are no new dependencies.Now consider pairs of attributes: AB+ = ABCD, AC+ = AC, AD+ = ABCD, BC+ = ABCD, BD+ = BD, CD+ = ABCD. Thus the new dependencies are ABD, ADC, BCA and CDB.For the triples of attributes,

16、 all the closures of the sets are each ABCD. Thus, we get new dependencies ABCD, ABDC, ACDB and BCDA.Since ABCD+ = ABCD, we get no new dependencies.The collection of 8 new dependencies mentioned above are: ABD, ADC, BCA, CDB, ABCD, ABDC, ACDB and BCDA.iii) For the single attributes we have A+ = ABCD

17、, B+ = ABCD, C+ = ABCD, and D+ = ABCD. Thus, the new dependencies are AC, AD, BD, BA, CA, CB, DB and DC.Since all the single attributes closures are ABCD, any superset of the single attributes will also lead to a closure of ABCD. Knowing this, we can enumerate the rest of the new dependencies.The co

18、llection of 24 new dependencies mentioned above are: AC, AD, BD, BA, CA, CB, DB, DC, ABC, ABD, ACB, ACD, ADB, ADC, BCA, BCD, BDA, BDC, CDA, CDB, ABCD, ABDC, ACDB and BCDA.Exercise 3.2.2bi) From the analysis of closures in 3.2.2a(i), we find that the only key is A. All other sets either do not have A

19、BCD as the closure or contain A.ii) From the analysis of closures 3.2.2a(ii), we find that AB, AD, BC, and CD are keys. All other sets either do not have ABCD as the closure or contain one of these four sets.iii) From the analysis of closures 3.2.2a(iii), we find that A, B, C and D are keys. All oth

20、er sets either do not have ABCD as the closure or contain one of these four sets.Exercise 3.2.2ci) The superkeys are all those sets that contain one of the keys in 3.2.2b(i). The superkeys are AB, AC, AD, ABC, ABD, ACD, BCD and ABCD.ii) The superkeys are all those sets that contain one of the keys i

21、n 3.2.2b(ii). The superkeys are ABC, ABD, ACD, BCD and ABCD.iii) The superkeys are all those sets that contain one of the keys in 3.2.2b(iii). The superkeys are AB, AC, AD, BC, BD, CD, ABC, ABD, ACD, BCD and ABCD.Exercise 3.2.3aSince A1A2AnC contains A1A2An, then the closure of A1A2AnC contains B. T

22、hus it follows that A1A2AnCB.Exercise 3.2.3bFrom 3.2.3a, we know that A1A2AnCB. Using the concept of trivial dependencies, we can show that A1A2AnCC. Thus A1A2AnCBC. Exercise 3.2.3cFrom A1A2AnE1E2Ej, we know that the closure contains B1B2Bm because of the FD A1A2An B1B2Bm. The B1B2Bm and the E1E2Ej

23、combine to form the C1C2Ck. Thus the closure of A1A2AnE1E2Ej contains D as well. Thus, A1A2AnE1E2EjD.Exercise 3.2.3dFrom A1A2AnC1C2Ck, we know that the closure contains B1B2Bm because of the FD A1A2An B1B2Bm. The C1C2Ck also tell us that the closure of A1A2AnC1C2Ck contains D1D2Dj. Thus, A1A2AnC1C2C

24、kB1B2BkD1D2Dj. Exercise 3.2.4aIf attribute A represented Social Security Number and B represented a persons name, then we would assume AB but BA would not be valid because there may be many people with the same name and different Social Security Numbers.Exercise 3.2.4bLet attribute A represent Socia

25、l Security Number, B represent gender and C represent name. Surely Social Security Number and gender can uniquely identify a persons name (i.e. ABC). A Social Security Number can also uniquely identify a persons name (i.e. AC). However, gender does not uniquely determine a name (i.e. BC is not valid

26、).Exercise 3.2.4cLet attribute A represent latitude and B represent longitude. Together, both attributes can uniquely determine C, a point on the world map (i.e. ABC). However, neither A nor B can uniquely identify a point (i.e. AC and BC are not valid).Exercise 3.2.5Given a relation with attributes

27、 A1A2An, we are told that there are no functional dependencies of the form B1B2Bn-1C where B1B2Bn-1 is n-1 of the attributes from A1A2An and C is the remaining attribute from A1A2An. In this case, the set B1B2Bn-1 and any subset do not functionally determine C. Thus the only functional dependencies

28、that we can make are ones where C is on both the left and right hand sides. All of these functional dependencies would be trivial and thus the relation has no nontrivial FDs.Exercise 3.2.6Lets prove this by using the contrapositive. We wish to show that if X+ is not a subset of Y+, then it must be t

29、hat X is not a subset of Y. If X+ is not a subset of Y+, there must be attributes A1A2An in X+ that are not in Y+. If any of these attributes were originally in X, then we are done because Y does not contain any of the A1A2An. However, if the A1A2An were added by the closure, then we must examine th

30、e case further. Assume that there was some FD C1C2CmA1A2Aj where A1A2Aj is some subset of A1A2An. It must be then that C1C2Cm or some subset of C1C2Cm is in X. However, the attributes C1C2Cm cannot be in Y because we assumed that attributes A1A2An are only in X+ and are not in Y+. Thus, X is not a s

31、ubset of Y.By proving the contrapositive, we have also proved if X Y, then X+ Y+.Exercise 3.2.7The algorithm to find X+ is outlined on pg. 76. Using that algorithm, we can prove that (X+)+ = X+. We will do this by using a proof by contradiction.Suppose that (X+)+ X+. Then for (X+)+, it must be that

32、some FD allowed additional attributes to be added to the original set X+. For example, X+ A where A is some attribute not in X+. However, if this were the case, then X+ would not be the closure of X. The closure of X would have to include A as well. This contradicts the fact that we were given the c

33、losure of X, X+. Therefore, it must be that (X+)+ = X+ or else X+ is not the closure of X.Exercise 3.2.8aIf all sets of attributes are closed, then there cannot be any nontrivial functional dependencies. Suppose A1A2.AnB is a nontrivial dependency. Then A1A2.An+ contains B and thus A1A2.An is not cl

34、osed.Exercise 3.2.8bIf the only closed sets are and A,B,C,D, then the following FDs hold:ABACADBABCBDCACBCDDADBDCABCABDACBACDADBADCBCABCDBDABDCCDACDBABCDABDCACDBBCDAExercise 3.2.8cIf the only closed sets are , A,B and A,B,C,D, then the following FDs hold:ABBACACBCDDADBDCACBACDADBADCBCABCDBDABDCCDACD

35、BABCDABDCACDBBCDAExercise 3.2.9We can think of this problem as a situation where the attributes A,B,C represent cities and the functional dependencies represent one way paths between the cities. The minimal bases are the minimal number of pathways that are needed to connect the cities. We do not wan

36、t to create another roadway if the two cities are already connected.The systematic way to do this would be to check all possible sets of the pathways. However, we can simplify the situation by noting that it takes more than two pathways to visit the two other cities and come back. Also, if we find a

37、 set of pathways that is minimal, adding additional pathways will not create another minimal set.The two sets of minimal bases that were given in example 3.11 are:AB, BC, CAAB, BA, BC, CBThe additional sets of minimal bases are:CB, BA, ACAB, AC, BA, CAAC, BC, CA, CBExercise 3.2.10aWe need to compute

38、 the closures of all subsets of ABC, although there is no need to think about the empty set or the set of all three attributes. Here are the calculations for the remaining six sets:A+=AB+=BC+=ACEAB+=ABCDEAC+=ACEBC+=ABCDEWe ignore D and E, so a basis for the resulting functional dependencies for ABC

39、is: CA and ABC. Note that BC-A is true, but follows logically from C-A, and therefore may be omitted from our list.Exercise 3.2.10bWe need to compute the closures of all subsets of ABC, although there is no need to think about the empty set or the set of all three attributes. Here are the calculatio

40、ns for the remaining six sets:A+=ADB+=BC+=CAB+=ABDEAC+=ABCDEBC+=BCWe ignore D and E, so a basis for the resulting functional dependencies for ABC is: ACB.Exercise 3.2.10cWe need to compute the closures of all subsets of ABC, although there is no need to think about the empty set or the set of all th

41、ree attributes. Here are the calculations for the remaining six sets:A+=AB+=BC+=CAB+=ABDAC+=ABCDEBC+=ABCDEWe ignore D and E, so a basis for the resulting functional dependencies for ABC is: ACB and BCA.Exercise 3.2.10dWe need to compute the closures of all subsets of ABC, although there is no need t

42、o think about the empty set or the set of all three attributes. Here are the calculations for the remaining six sets:A+=ABCDEB+=ABCDEC+=ABCDEAB+=ABCDEAC+=ABCDEBC+=ABCDEWe ignore D and E, so a basis for the resulting functional dependencies for ABC is: AB, BC and CA.Exercise 3.2.11For step one of Alg

43、orithm 3.7, suppose we have the FD ABCDE. We want to use Armstrongs Axioms to show that ABCD and ABCE follow. Surely the functional dependencies DED and DEE hold because they are trivial and follow the reflexivity property. Using the transitivity rule, we can derive the FD ABCD from the FDs ABCDE an

44、d DED. Likewise, we can do the same for ABCDE and DEE and derive the FD ABCE.For steps two through four of Algorithm 3.7, suppose we have the initial set of attributes of the closure as ABC. Suppose also that we have FDs CD and DE. According to Algorithm 3.7, the closure should become ABCDE. Taking

45、the FD CD and augmenting both sides with attributes AB we get the FD ABCABD. We can use the splitting method in step one to get the FD ABCD. Since D is not in the closure, we can add attribute D. Taking the FD DE and augmenting both sides with attributes ABC we get the FD ABCDABCDE. Using again the

46、splitting method in step one we get the FD ABCDE. Since E is not in the closure, we can add attribute E.Given a set of FDs, we can prove that a FD F follows by taking the closure of the left side of FD F. The steps to compute the closure in Algorithm 3.7 can be mimicked by Armstrongs axioms and thus we can prove F from the given set of FDs using Armstrongs axioms. Exercise 3.3.1aIn the solution to Exercis