let F, be a canonical cover for F, i:= 0; for each functional dependency a → ß in F. i:=i+ 1; R, := aß; if none of the schemas R,j = 1, 2, ..,i contains a candidate key for R then i:= i+ 1; R, := any candidate key for R; /* Optionally, remove redundant relations */ reрeat if any schema R, is contained in another schema R, then /* Delete R, */ R, := R;: i:=i - 1; until no more R,s can be deleted return (R1, R2, ... ,R,) Figure 7.12 Dependency-preserving, lossless decomposition into 3NF.
let F, be a canonical cover for F, i:= 0; for each functional dependency a → ß in F. i:=i+ 1; R, := aß; if none of the schemas R,j = 1, 2, ..,i contains a candidate key for R then i:= i+ 1; R, := any candidate key for R; /* Optionally, remove redundant relations */ reрeat if any schema R, is contained in another schema R, then /* Delete R, */ R, := R;: i:=i - 1; until no more R,s can be deleted return (R1, R2, ... ,R,) Figure 7.12 Dependency-preserving, lossless decomposition into 3NF.
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
Related questions
Question
follow the
![let F, be a canonical cover for F;
i:= 0;
for each functional dependency a → B in F.
i:= i+ 1;
R, := a ß;
if none of the schemas R,.j = 1, 2, ...,i contains a candidate key for R
then
i:= i+ 1;
R, := any candidate key for R;
1* Optionally, remove redundant relations */
repeat
if any schema R, is contained in another schema R.
then
/* Delete R, */
R, := R;;
i:=i- 1;
until no more R,s can be deleted
return (R1, R2. .., R,)
Figure 7.12 Dependency-preserving, lossless decomposition into 3NF.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F8b37120c-4c43-4481-aeac-e81d7520c137%2F6d684dda-e5ce-479a-9c40-db771a45df74%2Ftm8j4j_processed.png&w=3840&q=75)
Transcribed Image Text:let F, be a canonical cover for F;
i:= 0;
for each functional dependency a → B in F.
i:= i+ 1;
R, := a ß;
if none of the schemas R,.j = 1, 2, ...,i contains a candidate key for R
then
i:= i+ 1;
R, := any candidate key for R;
1* Optionally, remove redundant relations */
repeat
if any schema R, is contained in another schema R.
then
/* Delete R, */
R, := R;;
i:=i- 1;
until no more R,s can be deleted
return (R1, R2. .., R,)
Figure 7.12 Dependency-preserving, lossless decomposition into 3NF.
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 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education