NFexamples - Normalisation Example CS2312 Normalisation...

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

View Full Document Right Arrow Icon
Normalisation Example CS2312
Background image of page 1

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

View Full DocumentRight Arrow Icon
Normalisation Example BEER_DATABASE beer brewery strength city region ware house quantity Choice Websters XX York North West 1 200 4 100 8 Old Bob XXX 1 300 2 Landlord Taylors Leeds 8 3 190 Directors Fremlins X London South East 6 400 X 4 290 Wobbly Joe Sam Smith XXXX 4 90 Watery Whitbread O null Additional Notes: Warehouses are shared by breweries. Each beer is unique to the brewer. Each brewery is based in a city.
Background image of page 2
Minimal Sets of Functional Dependencies A set of functional dependencies F is minimal if: 1. Every dependency F has a single determined attribute A 2. We cannot remove any dependency from F and still have a set of dependencies equivalent to F 3. We cannot replace and dependency X A in F with a dependency A X, where A X and still have a set of dependencies that is equivalent to F I.e. a canonical form with no redundancies (beer , brewery, strength, city, region, warehouse , quantity) beer brewery beer strength brewery city city region beer, warehouse, quantity
Background image of page 3

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

View Full DocumentRight Arrow Icon
Relational Synthesis Algorithm into 3NF: (beer
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 8

NFexamples - Normalisation Example CS2312 Normalisation...

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

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