- Algorithm for computing a canonical cover [1]
- References
A canonical cover 
for F (a set of functional dependencies on a relation scheme) is a set of dependencies such that F logically implies all dependencies in , and logically implies all dependencies in F.
The set has two important properties:
- No functional dependency in contains an extraneous attribute.
- Each left side of a functional dependency in is unique. That is, there are no two dependencies
and 
in such that 
.
A canonical cover is not unique for a given set of functional dependencies, therefore one set F can have multiple covers .
Algorithm for computing a canonical cover [1]
-
- Repeat:
- Use the union rule to replace any dependencies in of the form and
with 
.. - Find a functional dependency in with an extraneous attribute and delete it from
- Use the union rule to replace any dependencies in
- ... until does not change
References
1. ^Database system concepts by Abraham Silberschatz et al
3 : Database theory|Mathematical concepts|Database algorithms
- Mark Ormerod (civil servant)
- Mark Ormerod (disambiguation)
- Mark Ormrod
- Mark Ormrod (disambiguation)
- Mark Ormrod (historian)
- Marko Salminen
- Marko Samardzić
- Marko Saric
- Marko Savić (basketball)
- Mark Osborne (cricketer)
- Marko Schafferer
- Marko Segedinac
- Markose Mor Chrisostamos
- Markose Mor Chrysostomos
- Marko, Serbian King
- Marko, Serbian Prince
- Marko Simic (footballer, born 1985)
- Marko Simic (footballer, born 1988)
- Marko Simic (footballer, born 1993)
- Marko Simonović (basketball, born 1999)
- Marko Simovic
- Markos Kalovelonis
- Markoska, Sara
- Marko Soldo
- Markos Palaiologos Iagaris