UNIVERSITÄT MÜNSTER Computing Unique Canonical Covers for Simple FDs via Transitive Reduction (2004)
Download:
by J. Lechtenbörger, Jens Lechtenbörger
http://dbms.uni-muenster.de/publications/downloads/tech4-04.pdf
Add To MetaCart
Abstract:
Although there is a rich body of research on dependency theory, only few results concerning simple functional dependencies (FDs) have been published. In this paper, the following key results regarding simple FDs are shown. First, given an acyclic set F of simple FDs there exists exactly one canonical cover for F. Second, this uniquely determined canonical cover can be computed via transitive reduction. Third, it is shown how a uniquely determined canonical cover can be fixed in case of arbitrary simple FDs via transitive reduction. 1
Citations
| 346 | The Theory of Relational Databases – Maier - 1986 |
| 101 | The transitive reduction of a directed graph – Aho, Garey, et al. - 1972 |
| 15 | Graph algorithms for functional dependency manipulation – Ausiello, D’Atri, et al. - 1983 |
| 12 | Multidimensional normal forms for data warehouse design – Lechtenbörger, Vossen - 2003 |
| 10 | Simple Conditions for Guaranteeing Higher Normal Forms in Relational Databases – Date, Fagin - 1992 |
