Data Normalization - Information Systems Reengineering, Integration and Normalization - page 364

We can apply the XML schema design algorithm to derive the smallest closure
functional dependency fragments and map them into a DTD Graph for implementa-
tion as follows:
After the first pass of repeat loop in Step 3, we have the following closure of each
element according to each given data semantic:

Student + = Student

Tutor + = Tutor

Lecturer + = Lecturer

Professor + = Professor

RetirementPlan +

= RetirementPlan, FullTime

HourlyRate + = HourlyRate, PartTime

Course + = Course

Instructor + = Instructor, Employee

Employee +

= Employee

Head +

= Head, Employee, Department

Department + = Department, Employee, Head

FullTime + = FullTime, Instructor +

PartTime + = PartTime, Instructor +

Lab + = Lab, Course

Lecture +

= Lecture, Course

We can group related closures into the same fragment by combining closures with
the same element into a fragment as follows:

Fragment 1: Student + = Student

Fragment 2: Tutor + = Tutor

Fragment 3: Lecturer + = Lecturer

Fragment 4: Professor + = Professor

Fragment 5: Course +

= Course

+

Lab = Lab, Course

Lecture +

= Lecture, Course

Fragment 6: Employee +

= Employee

+

Instructor
Head

= Instructor, Employee

+

= Head, Employee, Department

Department +

= Department, Employee, Head

+

= FullTime, Instructor +

FullTime
PartTime + = PartTime, Instructor +
RetirementPlan + = RetirementPlan, FullTime

HourlyRate + = HourlyRate, PartTime