The synthesis approach for relational database design

an expanded perspective

Sudha Ram, Stephen M. Curran

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 languageEnglish (US)
Pages (from-to)53-73
Number of pages21
JournalInformation Sciences
Volume52
Issue number1
DOIs
StatePublished - 1990

Fingerprint

Database Design
Relational Database
Functional Dependency
Cover
Synthesis
Pascal (programming language)
Schema
Pascal
Enhancement
Database design
Relational database

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Information Systems
  • Information Systems and Management
  • Statistics, Probability and Uncertainty
  • Electrical and Electronic Engineering
  • Statistics and Probability

Cite this

The synthesis approach for relational database design : an expanded perspective. / Ram, Sudha; Curran, Stephen M.

In: Information Sciences, Vol. 52, No. 1, 1990, p. 53-73.

Research output: Contribution to journalArticle

@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",
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

Y1 - 1990

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

VL - 52

SP - 53

EP - 73

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

IS - 1

ER -