The synthesis approach for relational database design: an expanded perspective

Sudha Ram; Stephen M. Curran

doi:10.1016/0020-0255(90)90035-9

The synthesis approach for relational database design: an expanded perspective

Sudha Ram, Stephen M. Curran

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

This paper addresses relational database design using the concept of functional dependencies (FDs). The classical synthesis approach processes a given set of functional dependencies to produce one minimal cover. This cover is then used to develop a relational schema; however, a given set of FDs may have more than one minimal cover. In turn, different minimal covers may 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 functional dependencies. 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 language	English (US)
Pages (from-to)	53-73
Number of pages	21
Journal	Information Sciences
Volume	52
Issue number	1
DOIs	https://doi.org/10.1016/0020-0255(90)90035-9
State	Published - Oct 1990

ASJC Scopus subject areas

Software
Control and Systems Engineering
Theoretical Computer Science
Computer Science Applications
Information Systems and Management
Artificial Intelligence

Access to Document

10.1016/0020-0255(90)90035-9

Cite this

@article{56f4ee2a18944fee893b362c7f194319,

title = "The synthesis approach for relational database design: an expanded perspective",

abstract = "This paper addresses relational database design using the concept of functional dependencies (FDs). The classical synthesis approach processes a given set of functional dependencies to produce one minimal cover. This cover is then used to develop a relational schema; however, a given set of FDs may have more than one minimal cover. In turn, different minimal covers may 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 functional dependencies. 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, {Stephen M.}",

year = "1990",

month = oct,

doi = "10.1016/0020-0255(90)90035-9",

language = "English (US)",

volume = "52",

pages = "53--73",

journal = "Information Sciences",

issn = "0020-0255",

publisher = "Elsevier Inc.",

number = "1",

}

TY - JOUR

T1 - The synthesis approach for relational database design

T2 - an expanded perspective

AU - Ram, Sudha

AU - Curran, Stephen M.

PY - 1990/10

Y1 - 1990/10

N2 - This paper addresses relational database design using the concept of functional dependencies (FDs). The classical synthesis approach processes a given set of functional dependencies to produce one minimal cover. This cover is then used to develop a relational schema; however, a given set of FDs may have more than one minimal cover. In turn, different minimal covers may 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 functional dependencies. 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 - This paper addresses relational database design using the concept of functional dependencies (FDs). The classical synthesis approach processes a given set of functional dependencies to produce one minimal cover. This cover is then used to develop a relational schema; however, a given set of FDs may have more than one minimal cover. In turn, different minimal covers may 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 functional dependencies. 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=0025573013&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025573013&partnerID=8YFLogxK

U2 - 10.1016/0020-0255(90)90035-9

DO - 10.1016/0020-0255(90)90035-9

M3 - Article

AN - SCOPUS:0025573013

SN - 0020-0255

VL - 52

SP - 53

EP - 73

JO - Information Sciences

JF - Information Sciences

IS - 1

ER -

The synthesis approach for relational database design: an expanded perspective

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this