Consider the relational database schema R( A, B, C, D, E, F, G, H, I) with the following set of functional dependencies: {A} → {E, F} {A,B,C,D} → {G,H} {C,D,G} → {A,B,I} {H} → {I} A. Use the inference rules to show that {A,B,C,D} → {1}. B. Determine which ones of the following sets of attributes are superkeys and which ones are also candidate keys: {A,B,C,D} {C,D,G,H} {C,D,G} Justify your answer by computing the closures. ! C. Use the candidate keys that you have identified in part B to decompose the relation R such that it satisfies the 2NF.
Consider the relational database schema R( A, B, C, D, E, F, G, H, I) with the following set of functional dependencies: {A} → {E, F} {A,B,C,D} → {G,H} {C,D,G} → {A,B,I} {H} → {I} A. Use the inference rules to show that {A,B,C,D} → {1}. B. Determine which ones of the following sets of attributes are superkeys and which ones are also candidate keys: {A,B,C,D} {C,D,G,H} {C,D,G} Justify your answer by computing the closures. ! C. Use the candidate keys that you have identified in part B to decompose the relation R such that it satisfies the 2NF.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Computer science question
![Consider the relational database schema R(A, B, C, D, E, F, G, H, 1) with the following
set of functional dependencies:
{A} → {E, F}
{A,B,C,D} → {G,H}
{C,D,G} → {A,B,I}
• {H} → {I}
A. Use the inference rules to show that {A,B,C,D} →{I}.
B. Determine which ones of the following sets of attributes are superkeys and which
ones are also candidate keys:
- {A,B,C,D}
- {C,D,G,H}
{C,D,G}
Justify your answer by computing the closures.
C. Use the candidate keys that you have identified in part B to decompose the relation R such that
it satisfies the 2NF.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F10447575-fb09-4c88-9d68-ab3c41fe0f21%2F30fb89fa-2682-4a5c-8938-b434737be944%2F00rkyvr_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Consider the relational database schema R(A, B, C, D, E, F, G, H, 1) with the following
set of functional dependencies:
{A} → {E, F}
{A,B,C,D} → {G,H}
{C,D,G} → {A,B,I}
• {H} → {I}
A. Use the inference rules to show that {A,B,C,D} →{I}.
B. Determine which ones of the following sets of attributes are superkeys and which
ones are also candidate keys:
- {A,B,C,D}
- {C,D,G,H}
{C,D,G}
Justify your answer by computing the closures.
C. Use the candidate keys that you have identified in part B to decompose the relation R such that
it satisfies the 2NF.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY