Ashraf Ali Waseem
ABSTRACT
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.
- Codd, E. F. 1972. Further Normalization of the Database Relational Model. In Database Systems, Courant Inst. CS Symposium. 6, R. Rustin, ed., Prentice-Hall, Englewood Cliffs, N.J., 33--64, 1972.Google Scholar
- Beeri, C. and Bernstein, P. A. 1979. Computational Problems Related to the Design of Normal Form Relational Schemas. ACM Trans. Database Systems, 1979. Google ScholarDigital Library
- Bernstein, P. A. 1976. Synthesizing Third Normal Form Relations from Functional Dependencies. ACM Trans. Database Syst. 1(4), 277--298, Dec. 1976. Google ScholarDigital Library
- Zaniolo, C. and Melkanoff, M. 1982. A Formal Approach to the Definition and the Design of Conceptual Schemata for Database Schemata. ACM Transactions on Database Systems, Vol. 7, No. 1, 24--59, March 1982. Google ScholarDigital Library
- Beeri, C. and Kifer, M. 1986. An Integrated Approach to Logical Design of Relational Database Schemes. ACM Transactions on Database Systems, Vol. 11, No. 2, 134--158, 1986. Google ScholarDigital Library
- Fagin, R. 1977. The Decomposition versus Synthetic Approach to Relational Database Design. In Proceedings of the third International Conference on Very Large Databases, (Tokyo, Oct. 1977) 441--446. Google ScholarDigital Library
- Sudha Ram, and Curran, S. M. 1988. The Synthesis Approach for Relational Database Design: An Expanded Perspective. In Proceedings of the Twenty-First IEEE Annual Hawaii International Conference on System Sciences, Software Track, Vol. II, 571--580, 1988, ISBN: 0-8186-0842-0 Google ScholarDigital Library
- Date, C. J., Kannan, A., and Swamynathan, S. 2006. An Introduction to Database Systems. 8th ed., India: Dorling Kindersley, 2006. Google ScholarDigital Library
- Silberschatz, A., Korth, H. F., and Sudarshan, S. 2006. Database System Concepts. 5th ed., Boston, MA: McGraw-Hill, ISBN: 007124476X, 2006. Google ScholarDigital Library
- Maier, D. 1983. The Theory of Relational Databases. Rockville, USA: Computer Science Press, 1983. Google ScholarDigital Library
- Darwen, H. and Date C. J. 1992. The Role of Functional Dependence in Query Decomposition. In Relational Database Writings 1989-1991, Reading, Mass.: Addison-Wesley 1992.Google Scholar
- Maier, D. 1980. Minimum Covers in the Relational Database Model. J. ACM 27(4), 664--674, 1980. Google ScholarDigital Library
- Armstrong, W. W. 1974. Dependency Structures of Database Relationships. In Proceedings of IFIP Congress (Stockholm, Sweden, 1974).Google Scholar
- Date, C. J. 2003. An Introduction to Database Systems. 8th ed., Instructor's Manual, 11.8--11.9, 2003. Google ScholarDigital Library
- Ullman, J. D. 1982. Principles of Database Systems. Second Edition, 1982, Computer Science Press, Rockville, MD 20850. Google ScholarDigital Library
- Atoum, J., Bader, D., and Awajan, A. 2008. Mining Functional Dependency from Relational Databases using Equivalent Classes and Minimal Cover. Journal of Computer Science 4 (6), 421--426, 2008.Google ScholarCross Ref
- Yao, H., Hamilton, H. J. 2008. Mining Functional Dependencies from Data. Journal of Data Mining and Knowledge Discovery, v.16 n.2, 197--219, April 2008. {doi:10.1007/s10618-007-0083-9} Google ScholarDigital Library
- Atoum, J. 2009. Mining Approximate Functional Dependencies from Databases Based on Minimal Cover and Equivalent Classes. European Journal of Scientific Research, Vol. 33 Issue 2, 338, Jul 2009.Google Scholar
Index Terms
- An extended synthesis algorithm for relational database schema design
Recommendations
A Parallel Algorithm for Relational Database Normalization
The problem of database normalization in a parallel environment is examined. Generating relation schemes in third normal form is straightforward when given a set of functional dependencies that is a reduced cover. It is shown that a reduced cover for a ...
On the design of relational database schemata
The purpose of this paper is to present a new approach to the conceptual design of relational databases based on the complete relatability conditions (CRCs).
It is shown that current database design methodology based upon the elimination of anomalies is ...
Comments