Designing globally consistent network schemas

Sharon M. Kuck, Yehoshua Sagiv

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper we address several problems relating to functional dependencies and network schemas. We investigate properties of the functional dependencies that are implicitly defined in a network schema. A definition for the satisfaction of functional dependencies by a network database is proposed, and then we give a sufficient condition for the global consistency of a network schema. A network schema is globally consistent if all its databases satisfy the functional dependencies that are implicitly defined in the schema. Finally, we describe a design methodology for producing a network schema whose set of implicitly defined functional dependencies implies a set of functional dependencies specified by the user.

Original languageEnglish
Title of host publicationProceedings of the 1983 ACM SIGMOD International Conference on Management of Data, SIGMOD 1983
PublisherAssociation for Computing Machinery
Pages185-195
Number of pages11
ISBN (Electronic)0897911040
DOIs
StatePublished - 23 May 1983
Event1983 ACM SIGMOD International Conference on Management of Data, SIGMOD 1983 - San Jose, United States
Duration: 23 May 198326 May 1983

Publication series

NameProceedings of the ACM SIGMOD International Conference on Management of Data
ISSN (Print)0730-8078

Conference

Conference1983 ACM SIGMOD International Conference on Management of Data, SIGMOD 1983
Country/TerritoryUnited States
CitySan Jose
Period23/05/8326/05/83

Bibliographical note

Publisher Copyright:
© 1983 Association for Computing Machinery. All rights reserved.

Fingerprint

Dive into the research topics of 'Designing globally consistent network schemas'. Together they form a unique fingerprint.

Cite this