Computing unique canonical covers for simple FDs via transitive reduction

Authors:
Jens Lechtenbörger
Affiliations:
Dept. of Information Systems, University of Münster, Leonardo-Campus 3, D-48149 Münster, Germany
Venue:
Information Processing Letters
Year:
2004

Citing 5
Cited 3

Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
Simple conditions for guaranteeing higher normal forms in relational databases

ACM Transactions on Database Systems (TODS)
Graph Algorithms for Functional Dependency Manipulation

Journal of the ACM (JACM)
Multidimensional normal forms for data warehouse design

Information Systems
Theory of Relational Databases

Theory of Relational Databases

Schema versioning in data warehouses: enabling cross-version querying via schema augmentation

Data & Knowledge Engineering - Special issue: WIDM 2004
Autonomous sets: a method for hypergraph decomposition with applications in database theory

FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Autonomous sets for the hypergraph of all canonical covers

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.89

Visualization

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.