The Community for Technology Leaders
Green Image
<p>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.</p>
subset closures; relational database scheme; elementary key normal form; functional dependences; subset closures; Hamiltonian cycles; time complexity; computational complexity; database theory; relational databases; set theory

P. Ng, C. Yang and G. Li, "An improved Algorithm Based on Subset Closures for Synthesizing a Relational Database Scheme," in IEEE Transactions on Software Engineering, vol. 14, no. , pp. 1731-1738, 1988.
100 ms
(Ver 3.3 (11022016))