Given a relation R(F, G, H, I, J, K) and functional dependencies: • G-> FI • H> JK The candidate key for the relation is GH. What are the prime attributes of the relation? What are the non-prime attributes of the relation? To be auto-graded correctly, place the attributes in the blank in alphabetical order, without spaces or commas.

Given a relation R(F, G, H, I, J, K) and functional dependencies: • G-> FI • H> JK The candidate key for the relation is GH. What are the prime attributes of the relation? What are the non-prime attributes of the relation? To be auto-graded correctly, place the attributes in the blank in alphabetical order, without spaces or commas.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider the following set F of functional dependencies on the relation schema (А, В, С, D, E, G): А— ВCD ВС — DE В — D D → A
PLEASE TYPE ONLY IF NOT YPE THEN DO NOT DO THIS*** Exercise 8.1.3: Matrices and arrow diagrams for relations expressed as sets of pairs. Draw the arrow diagram and the matrix representation for each relation. (b) The domain for relation R is {1, 2, 3, 4}. R = { (1, 2), (3, 4), (2, 3), (3, 2), (2, 1), (3, 1), (4, 3) }. (c) The domain for relation R is {1, 2, 3, 4}. R = { (1, 2), (2, 1), (3, 3) }. (d) The domain for relation R is {1, 2, 3}. R = ∅.
Select all binary relation properties that apply to the following relation: Equal magnitude: |x| = lyl O antisymmetric O reflexive O symmetric O transitive
1. Consider the relation R on the set (a,b.c,d,e,f] which is defined as follows: R-{(a,a), (a,b). (a.c). (b.a). (b.c), (c,a). (c,b). (d.d), (f.f)}. Is R reflexive? Is R symmetric? Is R anti-symmetric? Is R transitive? Give reasons!
Consider the relation schema R (A, B, C, D) with all possible functional dependencies. For each of the following situations, identify the highest normal form for this relation R. A, C -> B, D C -> D A, C -> B, D B -> D A, C -> B, D
22 of 40 Consider the following Relation instance of R1(A, B, C, D): A C D Null lo Null 1 Null 2 Null 1 1 3 Null 1 2 4 2 3 10 2 4 6 1 3 7 2 3 We also have relation R2 (E, F) which has no tuples. Suppose the attributes of R1 and R2 are all integers. How many tuples will there be in relation R2 after we perform the following 3 insertion statements? Insert into R2 (select B, sum(A) from R group by B); Insert into R2 (select A, sum(D) from R where D < 5 group by A); Insert into R2 (select C, sum(A) from R where A = A group by C); Answer: |5 |으
let R be a relation defined on the set z by aRb if a < b. What property/properties are violated? A. Symmetric & transitive B. Reflexive & Symmetric C. Reflexive & Transitive D. All three properties
Question 3 • Let A be the set A={a,b,c,d} and R is a relation on set A, where R = { (a,a), (a,b) ,(b,a),(b,b), (c,d),(c,c) ,(d,d)} Determine if R is a reflexive and symmetric relation on A.
1.) Let R be a relation defined on the set Z by aRb if a < b. What property/properties are violated?2.) If f(x) = x^3 + x - 1. What is f(x^2)?
36 of 40 Consider the relation scheme R = {A, B, C, D, E, F, G, H} with the following set of functional dependencies: F = {A → D, BH –→ AC, DG → H, F → GH, GH → F} How many candidate keys this relation has? Answer:
We have a relation with the following attributes: R={A,B,C,D,E} and all the attributes are atomic. Primary key of this relation is AB. What is the normal form of this relation given the following functional dependencies: AC→D, ABC, AB→D, ABE Select one: a. First Normal Form b. This relation is not normal. c. Third Normal Form d. Second Normal Form
Consider the relation schema R(A, B, C, D, E, F) and the set S = {AB->C, BC->AD, D->E, C->B) of functional dependencies. Assuming that R is decomposed into the relation schemas R1(A,B), R2(B,C), R3(A,B,D,E) and R4(E,F). Use the Chase test to show if this is a lossless decomposition.