Shared Flashcard Set

Details

Shippensburg CSC 371Functional Dependencies
Shippensburg CSC 371Functional Dependencies
9
Computer Science
Undergraduate 3
03/08/2012

Additional Computer Science Flashcards

 


 

Cards

Term
Armstrong's Reflexivity Rule
Definition
Given set of attributes X and Y are subsets of X, then X --> Y
Term
Armstrong's Augmentation Rule
Definition
If X --> Y , and Z is a set of attributes, then XZ --> Y Z. Also, this means that if X --> Y , then XZ --> Y )
Term
Armstrong's Transitivity Rule
Definition
If X --> Y, and Y --> Z, then X --> Z
Term
Union Rule (Supplemental)
Definition
If X --> Y and X --> Z, then X --> YZ
Term
Decomposition Rule (Supplemental)
Definition
If X --> YZ, then X --> Y and X --> Z
Term
Pseudo-transitivity Rule (Supplemental)
Definition
If X --> Y and YW --> Z, then XW --> Z
Term
Notation for Closure of a set of FDs 'F'
Definition
F+
Term
Algorithm for Determining Closure of X+ under set of FDs F
Definition

X+ ←  X
do {
     oldX+ ← X+
     for (each Y → Z EXISTS IN F)
          if (Y SUBSET OF X+)
               X+ ← X+ UNION Z
} until (oldX+ = X+)

Term
Symbology for Fully Functional Dependency
Definition

-/->

Single arrow with slash from bottom left to top right

Supporting users have an ad free experience!