Relational databases
An improved Algorithm Based on Subset Closures for Synthesizing a Relational Database Scheme
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)
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Graph Algorithms for Functional Dependency Manipulation
Journal of the ACM (JACM)
| Hi-index | 0.00 |
This paper describes a technical improvement of a synthesis algorithm for relational database scheme design, which was proposed by Yang et al. in 1988 [6]. The improvement is based on the observation that the original algorithm may lose attributes in a decomposition in special cases, due to an insufficient handling of representatives of equivalence classes formed over a given set of functional dependencies. The paper then proposes a correction of the original algorithm in which this problem disappears.