Relational Models and Dependencies
The search for optimality in database design has led to various
models and forms. One such model is the relational model, in whcih attributes
and dependencies are represented in tabular form. The relational model, unlike
other database models, has a number of clearly defined design goals. But there
is controversy over which of the goals, called normal forms, should be
attained. The synthesis algorithm attains Third Normal Form (3NF), but this
may have inconsistencies; the decomposition algorithm can attain Boyce-Codd
Normal Form (BCNF), which removes the inconsistencies fo 3NF, but BCNF
recognition is an NP-complete problem.
An elementary dependency (ED) is dependency that is minimal in the
number of attributes. An algorithm based on ED's which combines synthesis and
decomposition may attain a satisfactory compromise.
Programs |
People |
Courses |
Facilities |
Calendars |
Projects |
Jobs
IUP Math |
Nat Sci & Math |
IUP Info |
Related Sites
Read this
disclaimer.
Maintained by
Janet Scholz
<jscholz@grove.iup.edu>
Last Modified on Monday, 13-Aug-2001 16:53:04 EDT