Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
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
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
icon
Related questions
Question

follow the algorithm in Figure 7.12. You do not need to be overly verbose, but each stage of the decomposition should be shown and justified. Be sure to clearly show the final decomposition

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.
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
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Binary numbers
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.
Similar questions
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS