An approach for testing the primeness of attributes in relational schemas

Abstract

In this paper there is proposed a method of partition the attributes of relation scheme in equivalence classes and in nonredundant equivalence classes. Several properties of these equivalence classes are proved. Their properties serve as the basis for an algorithm with a polynomial complexity, which determines the prime attributes of a database schema.

Keywords

• Relation scheme
• functional dependencies
• equivalence classes
• prime attributes
• polynomial complexity tasks