logo
  • About us
  • Services
  • Products
  • Work
  • Contact

Feedback

In Focus

  • Flash XML slideshow
  • Database training

3.1.12. Function dependency

  • Consider a relation schema R(A,B,C,D) and a set F of functional dependencies
    • Aim to find all keys (minimal superkeys),
    • by determining closures of all possible X subsets of R’s attributes, e.g.
      • A+, B+, C+, D+,
      • AB+, AC+, AD+, BC+, BD+, CD+
      • ABC+, ABD+, BCD+
      • ABCD+
    ‹ 3.1.11. Algorithmup3.1.13. Worked example ›
  • s5 slideshow
 

 

 

Copyright 2007 Lightenna Limited

  • About us
  • Services
  • Products
  • Work
  • Contact