Design by example: An application of Armstrong relations

https://doi.org/10.1016/0022-0000(86)90015-2Get rights and content
Under an Elsevier user license
open archive

Abstract

Example relations, and especially Armstrong relations, can be used as user friendly representations of dependency sets. In this paper we analyze the use of Armstrong relations in database design with functional dependencies, and show how they and the usual representation of dependencies can be used together. Special attention is given to the size of Armstrong relations. We derive new bounds for the size of minimal Armstrong relations for normalized schemes. Specifically, any relation scheme in Boyce-Codd Normal Form has an Armstrong relation whose size is roughly the product of the lenghts of the keys for the scheme. New algorithms are also given for generating Armstrong relations and for inferring the functional dependencies holding in a relation.

Cited by (0)

This work was partially supported by the Academy of Finland. An extended abstract of this paper was presented at the Fourth ACM SIGACT-SIGMOD Conference on Principles of Database Systems, Portland, Oregon, March 1985.

This work was done while this author was visiting Cornell University.