Skip to search formSkip to main contentSkip to account menu

Canonical cover

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations

Broader (1)

Database theory
Functional dependencyRelation (database)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Optimal covers in the relational database model
The problem of finding an optimal cover which has possible fewest attributes is NP-complete. It is shown here that an optimal… 
2012
2012
COMPARING MANUAL AND AUTOMATIC NORMALIZATION TECHNIQUES FOR RELATIONAL DATABASE
Normalization is a process of analyzing the given relation schemas based on their Functional dependencies and primary keys to… 
2011
2011
Fourier-Mukai partners of canonical covers of bielliptic and Enriques surfaces
We prove that the canonical cover of an Enriques surface does not admit non-trivial Fourier-Mukai partners. We also show that the… 
2011
2011
Research on canonical cover in partial order temporal scheme
Existing effective design methods of temporal database with multiple time granularities are almost designed for totally-ordered… 
2011
2011
Reduction of a symplectic-like Lie algebroid with momentum map and its application to fiberwise linear Poisson structures
This paper addresses the problem of developing an extension of the Marsden–Weinstein reduction process to symplectic-like Lie… 
2009
2009
Mining Approximate Functional Dependencies from Databases Based on Minimal Cover and Equivalent Classes
Data Mining (DM) represents the process of extracting interesting and previously unknown knowledge from data. Approximate… 
2008
2008
Mining Functional Dependency from Relational Databases Using Equivalent Classes and Minimal Cover
Data Mining (DM) represents the process of extracting interesting and previously unknown knowledge from data. This study proposes… 
2004
2004
Discussion about Algorithms of Canonical Cover
This article distinguishes the definitions and algorithms of two kinds of functional dependency-set. It also points out the… 
Highly Cited
2001
Highly Cited
2001
Functional and embedded dependency inference: a data mining point of view
2001
2001
A short proof that hyperspaces of Peano continua are absolute retracts
. We give a short proof of Wojdyslawski’s famous theorem. 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)