The synthesis approach for relational database design: an expanded perspective
Proceedings of the Twenty-First Annual Hawaii International Conference on Software Track
An integrated approach to logical design of relational database schemes
ACM Transactions on Database Systems (TODS)
A formal approach to the definition and the design of conceptual schemata for databased systems
ACM Transactions on Database Systems (TODS)
Computational problems related to the design of normal form relational schemas
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)
Principles of Database Systems
Principles of Database Systems
An Introduction to Database Systems
An Introduction to Database Systems
Database Systems Concepts
Theory of Relational Databases
Theory of Relational Databases
The decomposition versus synthetic approach to relational database design
VLDB '77 Proceedings of the third international conference on Very large data bases - Volume 3
Mining functional dependencies from data
Data Mining and Knowledge Discovery
| Hi-index | 0.00 |
Relational model is the most essential database model for decades and is examined in various ways. A very important concept in the relational modeling is the concept of dependencies. Particularly a set of functional dependencies and its equivalent minimal cover are discussed here for synthesizing third normal form relations. A traditional synthesis algorithm have been used to reduce the set of functional dependencies, F, into an equivalent minimal cover. This cover is then used to develop a relational schema; however, a given set of functional dependencies may have more than one minimal covers. In turn, different minimal covers may give rise to different relational schema. Database designers had already been agreed upon the use of popular inference rules of Armstrong to obtain minimal covers from the set F of functional dependencies. Despite the frequent use of the traditional synthesis algorithm, there is still a lack of formality and simplicity support in that algorithm to produce a minimum cover, especially; the step(s) of the algorithm in which the set of functional dependencies of F are used to make left-irreducible remain informal. In this paper, an extension is proposed to the synthesis algorithm that aids in to produce an optimal minimal cover more systematically from the given set of functional dependencies. The optimal minimal cover obtained by this extension would be appropriate for synthesizing third normal form relational schema from the universal relation scheme.