1104-CNeuner

1104-CNeuner - R = {A,B,C,D} Q1: FD: ABC -> D D...

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

View Full Document Right Arrow Icon
Notes - 11/04/2008 Figure 10.28 (Exercise 102) At least D-entries in each node; At most 2D-entries N-values -> n+1 pointers Copy Over (splitting leaf nodes) - 100 to I3
Background image of page 1

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

View Full DocumentRight Arrow Icon
Insert 66 into Tree Delete 81 from Tree R = {A,B,C,D,E,F}
Background image of page 2
FD: A -> B B -> C B -> D C,E -> F Q: What is the key? Step: Compute the closures (set of attributes that can be derived) of the individual attributes. A+ = A,B,C,D B+ = B,C,D C+ = C D+ = D E+ = E F+ = F (AB)+ = A,B,C,D (AC)+ = (AB)+ (AE)+ = A,B,C,D,E,F <- SOLUTION - "accounts for all keys" (ACE)+ = A,B,C,D,E,F <- "accounts for all keys"
Background image of page 3

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

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

Unformatted text preview: R = {A,B,C,D} Q1: FD: ABC -&gt; D D -&gt; A Key = ABC Q2: FD: B -&gt; C D -&gt; A Key = BD [1NF but not 2NF] R = {A,B,C,D,E,F,G,H,I,J} FD: AB -&gt; C BD -&gt; EF AD -&gt; GH A -&gt; I H -&gt; J Q: Find the candidate key (minimum key). A+ = A,I B+ = B C+ = C D+ = D E+ - J+ = E - J H+ = H,J (AB)+ = A,B,C,I (ABD)+ = A,B,C,D,E,F,G,H,I,J &lt;- SOLUTION - &quot;accounts for all keys&quot; Normalization : 1. Find the candidate keys. 2. For all non-key attributes (non-prime): BCNF = Boyce-Codd Normal Form (stronger form of 3NF)...
View Full Document

Page1 / 4

1104-CNeuner - R = {A,B,C,D} Q1: FD: ABC -&amp;amp;gt; D D...

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