An improved Algorithm Based on Subset Closures for Synthesizing a Relational Database Scheme

Authors:
C.-C. Yang;G. Li;B. A.-B. Ng
Affiliations:
Univ. of North Texas, Denton;Univ. of North Texas, Denton;Univ. of North Texas, Denton
Venue:
IEEE Transactions on Software Engineering
Year:
1988

Citing 9
Cited 1

Relational databases

Relational databases
A logical design methodology for relational databases using the extended entity-relationship model

ACM Computing Surveys (CSUR)
Deduction Graphs: An Algorithm and Applications

IEEE Transactions on Software Engineering
An improved third normal form for relational databases

ACM Transactions on Database Systems (TODS)
A new normal form for the design of relational database schemata

ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies

ACM Transactions on Database Systems (TODS)
Minimum Covers in Relational Database Model

Journal of the ACM (JACM)
Graph Algorithms for Functional Dependency Manipulation

Journal of the ACM (JACM)
Theory of Relational Databases

Theory of Relational Databases

Thorough Investigation into "An Improved Algorithm Based on Subset Closures for Synthesizing a Relational Database Scheme"

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

An algorithm for synthesizing a better relational database scheme in elementary key normal form (EKNF) is developed. This algorithm eliminates not only extraneous attributes and other redundancies, but also superfluities from a given set of functional dependences (FDs), based primarily on subset closures, Hamiltonian cycles of FDs, and equivalent subsets of attributes. Following this algorithm, a better LR-minimum FD covering is obtained. A more practical and efficient method for designing a relational database scheme in EKNF is then provided. The time complexity of the algorithm is polynomial.