An efficient algorithm for 3NF determination

Authors:
Peter B. Worland
Affiliations:
Department of Computer Science, University of Wisconsin Oshkosh, Oshkosh, WI
Venue:
Information Sciences—Informatics and Computer Science: An International Journal
Year:
2004

Citing 6
Cited 0

Keys and superkeys for relation schemes

Computers and Artificial Intelligence
Graph Algorithms for Functional Dependency Manipulation

Journal of the ACM (JACM)
An improved algorithm for finding a key of a relation

PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Relational Database Systems

Relational Database Systems
Fundamentals of Database Systems

Fundamentals of Database Systems
Normalization and functional dependencies in the relational data base model.

Normalization and functional dependencies in the relational data base model.

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an algorithm that determines whether or not a relation R is in Third Normal Form (3NF). The algorithm works by classifying the attributes of R into so-called dependency sets that are based on the set of functional dependencies defined on R. A new type of dependency graph is introduced to visualize the dependencies. The algorithm will run faster than algorithms designed to find all of the candidate keys of R, especially if there exists more than one dependency set.