Computing unique canonical covers for simple fds via transitive reduction

Information Processing Letters

Volumn 92, Issue 4, 2004, Pages 169-174

  Lechtenbörger, Jens ^a  

^a UNIVERSITY OF MÜNSTER   (Germany)

Author keywords

Canonical cover; Databases; Simple functional dependency; Transitive reduction

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATABASE SYSTEMS; GRAPH THEORY; SET THEORY; THEOREM PROVING;

CANONICAL COVER; FUNCTIONAL DEPENDENCIES (FD); FUNCTIONAL DEPENDENCY; TRANSITIVE REDUCTION;

DATA PROCESSING;

EID: 5744244941     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.07.005     Document Type: Article

References (7)

1. A.V. Aho, M.R. Garey, J.D. Ullman, The transitive reduction of a directed graph, SIAM J. Comput. 1 (2) (1972) 131-137.
2. G. Ausiello, A. D'Atri, D. Saccà, Graph algorithms for functional dependency manipulation, J. ACM 30 (4) (1983) 752-766.
3. C.J. Date, R. Fagin, Simple conditions for guaranteeing higher normal forms in relational databases, ACM TODS 17 (8) (1992) 465-476.
4. M. Golfarelli, J. Lechtenbörger, S. Rizzi, G. Vossen, Schema versioning in data warehouses, in: Proc. 3rd International Workshop on Evolution and Change in Data Management, 2004, in press.
5. J. Lechtenbörger, G. Vossen, Multidimensional normal forms for data warehouse design, Inform. Systems 28 (5) (2003) 415-434.
6. D. Maier, The Theory of Relational Databases, Computer Science Press, 1983.
7. J.D. Ullman, Database and Knowledge-Base Systems, vol. 1, Computer Science Press, 1988.