TY - GEN
T1 - SYNTHESIS APPROACH FOR RELATIONAL DATABASE DESIGN
T2 - AN EXPANDED PERSPECTIVE.
AU - Ram, Sudha
AU - Curran, Stephan M.
PY - 1988
Y1 - 1988
N2 - Relational database design using the concept of functional dependencies (FDs) is addressed. The classical synthesis approach processes a given set of FDs to produce one minimal cover, which is then used to develop a relational schema. However, a given set of FDs can have more than one minimal cover, and different minimal covers can give rise to different relational schemata. An enhancement is proposed to the traditional synthesis algorithm that aids in efficiently determining all minimal covers for a given set of FDs. The algorithm has been implemented using Turbo Pascal on an IBM PC AT. The performance of this algorithm is compared with that of the traditional synthesis algorithm.
AB - Relational database design using the concept of functional dependencies (FDs) is addressed. The classical synthesis approach processes a given set of FDs to produce one minimal cover, which is then used to develop a relational schema. However, a given set of FDs can have more than one minimal cover, and different minimal covers can give rise to different relational schemata. An enhancement is proposed to the traditional synthesis algorithm that aids in efficiently determining all minimal covers for a given set of FDs. The algorithm has been implemented using Turbo Pascal on an IBM PC AT. The performance of this algorithm is compared with that of the traditional synthesis algorithm.
UR - http://www.scopus.com/inward/record.url?scp=0023866006&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0023866006&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0023866006
SN - 0818608420
T3 - Proceedings of the Hawaii International Conference on System Science
SP - 571
EP - 580
BT - Proceedings of the Hawaii International Conference on System Science
PB - IEEE
ER -