Authors: Vitalie Cotelea
Keywords: Relational database schema, functional dependencies, equivalence classes of attributes, normal forms, polynomial algorithms
Abstract
In this paper, based on equivalence classes of attributes there are formulated necessary and sufficient conditions that constraint a database schema to be in the second, third or Boyce-Codd normal forms. These conditions offer a polynomial complexity for the testing algorithms of the normalizations level.
Academy of Economic Studies of Moldova
Phone: (+373 22) 40 28 87
E-mail:
Fulltext

–
0.14 Mb