【精选】数据库期中考试2.pdfVIP

Database System Principles Test Two （07401 — 07405 ） Class____________No____________Name____________ 1. (6 points) Find out all the candidate keys for the following schema R and the functional dependencies F holding on it. R(A, B, C, D, E, F, G, H) F={A→B, C→E, B→FC, HA→BC} 注：要求写出计算过程 Answers: L={A, H} R={E, F} LR={B, C} N={D, G} + + (L ∪N) = (A, D G, H) = R, so the unique candidate key is ADGH 2. (10 points) Consider the relation schema about the sales information : Sales(Sales-TransactionNo, Item-No, Item-Price, Item-QuantitySold, Seller, SellerDistrict) The functional dependencies on Sales are shown below: Sales-TransactionNo, Item-No → Item-QuantitySold Item-No → Item-Price Sales-TransactionNo →Seller Seller→SellerDistrict Give a lossless-join, dependency-preserving decomposition of this schema into 3NF. Answer: Fc = { Sales-TransactionNo, Item-No → Item-QuantitySold Item-No → Item-Price Sales-TransactionNo →Seller Seller→SellerDistrict } the unique candidate key= { Sales-TransactionNo, Item-No} 3NF decomposition ： R1(Sales-TransactionNo, Item-No ,Item-QuantitySold ) R2(Item-No, Item-Price) R3(Sales-TransactionNo,Seller) R4(Seller,SellerDistrict) 3. (10 points) Given the relation student(Sno, Sdept, Sname, Ssocre) as shown below, which is organized as a sequential file. Taking the attribute Sscore as the search key, define a dense and secondary index for the indexed file student. The index file and index entries in the index file should be drawn. Sno Sdept Sname