FD_practice

pdf

School

Northern Virginia Community College *

*We aren’t endorsed by this school

Course

MISC

Subject

Computer Science

Date

Dec 6, 2023

Type

pdf

Pages

1

Uploaded by DoctorComputerMule3

Report
1. Consider a relation R with five attributes ABCDE. You are given the following dependencies: A ® B, BC ® E, and ED ® A. a) List all candidate keys for R. b) Is R in 3NF? c) Is R in BCNF? 2. Suppose that we have the following three tuples in a legal instance of a relation schema S with three attributes ABC (listed in order): (1, 2, 3), (4, 2, 3), and (5, 3, 3). a) Which of the following dependencies can you infer does not hold over schema S? A ® B, BC ® A, B ® C b) Can you identify any dependencies that hold over S? 3. Suppose you are given a relation R with four attributes, ABCD. For the following sets of FDs: C ® D, C ® A, B ® C, assuming those are the only dependencies that hold for R. a) Identify the candidate key(s) for R. b) Identify the best normal form that R satisfies (1NF, 2NF, 3NF, or BCNF). c) If R is not in BCNF, come up with a lossless join decomposition into a set of BCNF relations. Is your decomposition dependency preserving? 4. Consider the attribute set R=ABCDEFGH and the FD set F={ABC ® DEG, E ® BCG, F ® AH}. a) Find a minimal cover. b) If R is not in 3NF, come up with a dependency-preserving and lossless join decomposition into a set of 3NF relations.
Discover more documents: Sign up today!
Unlock a world of knowledge! Explore tailored content for a richer learning experience. Here's what you'll get:
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help