Computing unique canonical covers for simple FDs via transitive reduction

DOI10.1016/j.ipl.2004.07.005zbMath1173.68482OpenAlexW2044786206MaRDI QIDQ834931

Jens Lechtenbörger

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.07.005

zbMATH Keywords

databasescanonical covertransitive reductionsimple functional dependency

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (2)

Autonomous sets for the hypergraph of all canonical covers ⋮ Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory

Cites Work

• Multidimensional normal forms for data warehouse design.
• Graph Algorithms for Functional Dependency Manipulation
• The Transitive Reduction of a Directed Graph
• Unnamed Item

This page was built for publication: Computing unique canonical covers for simple FDs via transitive reduction