上海交通大学 数据库原理 陆朝俊 复习.docVIP

ER If we translate this diagram to relations in the normal way for E/R diagrams described in the textbook, which relation schema would not be in the resulting database schema? (A) E(a,c,b) (B) S(a,c,f,g) (C) F(c,d) (D) R(a,c) If we instead used the “object-oriented” approach to translating this E/R diagram to relations, how many relation schema would be different (when compared to the E/R-to-relations translation), either in their schema, or their set of tuples, or both? (A) 1 (B) 2 (C) 3 (D) 4  Convert the following E/R diagram (with details omitted) to a relational database schema using the object-oriented method. How many relation schemas will be produced? (Assume that each entity set has its own special attributes.) (A) 1 (B) 4 (C) 5 (D) 6 Relational Theory Given a relation R(A,B,C,D,E) and FDs AB(CE, B(D, and D(E, which of the following FD’s can not be inferred? (A) AD(CE (B) BC(D (C) AB(A (D) B(E Given a relation R(A,B,C,D) with FD: A(BC, which of the following MVD’s can not be inferred? (A) A((BC (B) A((B (C) A((BD (D) None of the above. Suppose we have a relation R(A,B,C,D,E) and the FD’s A(DE, D(B, and E(C. If we project R (and therefore its FD’s) onto schema S(A,B,C), what is true about the key(s) for S? (A) Only ABC is a key (B) Only A is a key (C) Only DE is a key (D) A, B, and C are each keys Suppose we are given a relation schema R(A,B,C,D,E) with functional dependencies A(B, BC(D and E(C. If we project R onto S(B,C,D,E), which of the following functional dependencies holds in S and is not a BCNF violation for S? (A) BC(D (B) BE(D (C) B(E (D) E(C Suppose that R(A,B,C,D) satisfies MVD:A((B and it is known that R has tuples (a1,b1,c1,d1), (a1,b2,c2,d2), and (a2,b1,c1,d2). How many tuples must R have at least? (A) 3 (B) 4 (C) 5 (D) 6 Relational algebra and Datalog In the following question, assume R and S are bags, and the operators are bag operators. Q1: (R∪ S) – (R∩S) Q2: (S–R) ∪ (R–S) (A) Q1 and Q2 produce the same