ics321-20091117-fdnf2 - ICS 321 Fall 2009 Schema Refinement...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
ICS 321 Fall 2009 Schema Refinement Asst. Prof. Lipyeow Lim University of Hawaii at Manoa 11/17/2009 1 Lipyeow Lim -- University of Hawaii at Manoa
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Two More Rules Union If X Y and X Z , then X YZ Eg. FLD A and FLD T, then FLD AT Decomposition If X YZ , then X Y and X Z Eg. FLD AT , then FLD A and FLD T Trivial FDs Right side is a subset of Left side Eg. F F, FLD FD 11/17/2009 Lipyeow Lim -- University of Hawaii at Manoa 2 Firstname Lastname DOB Address Telephone John Smith Sep 9 1979 Honolulu,HI 808-343-0809
Background image of page 2
Implication : An FD f is implied by a set of FDs F if f holds whenever all FDs in F hold. f=A C is implied by F={ A B, B C} (using Armstrong’s transitivity) Closure F + : the set of all FDs implied by F Algorithm : start with F + =F keep adding new implied FDs to F + by applying the 5 rules ( Armstrong’s Axioms + union + decomposition) Stop when F + does not change anymore. 11/17/2009
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 10

ics321-20091117-fdnf2 - ICS 321 Fall 2009 Schema Refinement...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online