Consider the depicted state for relation R in the table below:CWhich of the following statements regarding functional dependencies in R is correct?O Functional dependency B C may hold, but C B cannot hold.O Functional dependency C>B may hold, but B→C cannot hold.O Functional dependency A→C may hold, but C>A cannot hold.O Functional dependency C→A may hold, but A→C cannot hold. QUESTION 8The principal difference between a weak and strong entity in the Entity-Relationship model is best characterized by which of the following?Strong entities cannot have attributes.A weak entity exists in the model regardless of its affiliation with other entities, while a strong entity exists solely due to its relationship to oneor more weak entities in the model.O Weak entities cannot have attributes.A strong entity exists in the model regardless of its affiliation with other entities, while a weak entity exists solely due to its relationship to oneor more strong entities in the model.

Correct regarding functional dependencies in given relation R

Consider the depicted state for relation R in the table below: C y 2. Which of the following statements regarding functional dependencies in R is correct? Functional dependency B>C may hold, but C B cannot hold. Functional dependency C B may hold, but B C cannot hold. Functional dependency A→C may hold, but C A cannot hold. Functional dependency C-A may hold, but A→C cannot hold.

Consider the depicted state for relation R in the table below: C y 2. Which of the following statements regarding functional dependencies in R is correct? Functional dependency B>C may hold, but C B cannot hold. Functional dependency C B may hold, but B C cannot hold. Functional dependency A→C may hold, but C A cannot hold. Functional dependency C-A may hold, but A→C cannot hold.

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 functional dependencies that hold on R(ABCDEF): AB-> CD, E -> C, B -> EF Is R in 3NF? Explain your answer in detail and decompose the relation, as necessary, into a collection of relations that are in 3NF. Make sure you first find all the key(s) of R so that you will be able to tell whether an attribute is prime.
Consider the universal relation: R = (A, B, C, D, E, F, G, H, I, J) and the set of functional dependencies: A, B -> C B, D -> E, F A, D -> G, H A -> I H -> J What is the key for R? And Decompose R into 2NF, and then into 3NF relations.
Consider a relation schema R = (X, Y, Z) on which the following functionaldependencies hold: { XY → Z, Z → X }. Show that the schema R is not in BCNF(Boyce-Codd Normal Form) but it is in 3NF (Third Normal Form). Answer in detail
Let A1, A2, and A3 be attributes in a relation R. If both of these functional dependencies hold: A1 → A2 and A2 → A3, then A1 → A3 holds, because of the_? rule.
Assuming functional dependency A-->B holds, which of the following functional dependencies may not necessarily be true for some attribute X? O AX -> BX O All of the other options must be true O AX -- B O A> AX
J 1 Let R(A, B, C, D, E, F) be a relation schema, and let S = {A → B, BC → D, E → C, D →A, B → D} be a set of functional dependencies. Use the Nonadditive Join Test for Binary Decomposition to determine if the following decomposition is lossless.
Consider the universal relation R = {A, B, C, D, E, F, G, H, I, J} and the set of functional dependencies F = {{A, B} -> {C}, {B, D} -> {E, F}, {A, D} -> {G, H}, {A} -> {I}, {H} -> {J}}. What is the key for R? Decompose R into 2NF, then 3NF relations.
Give a BCNF decomposition to relation "r" according to the given functional dependencies. Show the steps of normalization clearly to get full credit. r(U, V, W, X, Y, Z) Z-> XY X -> VW V-> U XY -> Y
You are given a relation R with the following attributes R(A,B,C,D,E). Assume that you were given the following functional dependencies: • FD1= AB -> E • FD2: = D -> C (a) What is a valid key for this relation? justify your response. (b) Is this relation in 3NF (Third Normal Form)? Justify your response. If it is not in 3NF, normalize the relation and demonstrate all steps of normalization.
1. Consider a relation schema R1(A, B, C, D) that satisfies the set of functional dependencies F1 ={A→B, B→C, C→A}.a) Calculate A + and (AC)+b) Can AB→ C? Justify your answer.c) Find all the candidate keys of R1 using F1 and show your steps to find them. 2. Consider a relation schema R2(A, B, C, D) that satisfies the set of functional dependencies F2 = {A→B, C→D, D→AC}.a) Is (AD) is candidate key of R2? Justify your answer.b) Is R2 in BCNF? Explain the reason to your answer.c) If R2 is not in BCNF, give a lossless-join BCNF decomposition of R2. Is this decomposition dependency preserving? 3. Consider a relation schema R3(A, B, C, D, E) that satisfies the set of functional dependencies F3 = {A → BC, AC → BD}.a) Calculate (AC)+ and (AE)+b) Is AB → C in F3 +? Justify your answer.c) Find the canonical cover Fc of F3.d) Is R3 in 3NF? Explain the reason to your answer. If R3 is not in 3NF, give a lossless-join, dependency preserving 3NF decomposition of R3.