SYNTHESIS APPROACH FOR RELATIONAL DATABASE DESIGN: AN EXPANDED PERSPECTIVE.

Sudha Ram, Stephan M. Curran

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings of the Hawaii International Conference on System Science
PublisherIEEE
Pages571-580
Number of pages10
ISBN (Print)0818608420
StatePublished - 1988

Fingerprint

Pascal (programming language)

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Ram, S., & Curran, S. M. (1988). SYNTHESIS APPROACH FOR RELATIONAL DATABASE DESIGN: AN EXPANDED PERSPECTIVE. In Proceedings of the Hawaii International Conference on System Science (pp. 571-580). IEEE.

SYNTHESIS APPROACH FOR RELATIONAL DATABASE DESIGN : AN EXPANDED PERSPECTIVE. / Ram, Sudha; Curran, Stephan M.

Proceedings of the Hawaii International Conference on System Science. IEEE, 1988. p. 571-580.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ram, S & Curran, SM 1988, SYNTHESIS APPROACH FOR RELATIONAL DATABASE DESIGN: AN EXPANDED PERSPECTIVE. in Proceedings of the Hawaii International Conference on System Science. IEEE, pp. 571-580.
Ram S, Curran SM. SYNTHESIS APPROACH FOR RELATIONAL DATABASE DESIGN: AN EXPANDED PERSPECTIVE. In Proceedings of the Hawaii International Conference on System Science. IEEE. 1988. p. 571-580
Ram, Sudha ; Curran, Stephan M. / SYNTHESIS APPROACH FOR RELATIONAL DATABASE DESIGN : AN EXPANDED PERSPECTIVE. Proceedings of the Hawaii International Conference on System Science. IEEE, 1988. pp. 571-580
@inproceedings{e9b441b7819f4980b169fd1d4f325578,
title = "SYNTHESIS APPROACH FOR RELATIONAL DATABASE DESIGN: AN EXPANDED PERSPECTIVE.",
abstract = "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.",
author = "Sudha Ram and Curran, {Stephan M.}",
year = "1988",
language = "English (US)",
isbn = "0818608420",
pages = "571--580",
booktitle = "Proceedings of the Hawaii International Conference on System Science",
publisher = "IEEE",

}

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

SP - 571

EP - 580

BT - Proceedings of the Hawaii International Conference on System Science

PB - IEEE

ER -