Define the canonical cover, Database Management System

Assignment Help:

Define the Canonical cover

Ans: A canonical cover Fc for F is a set of dependencies like F logically implies all dependencies in Fc, and Fc logically entails all dependencies in F. Fc must have the subsequent properties:

  • No functional dependency in Fc consists of extraneous attribute
  • Every left side of a functional dependency in Fc is unique. Which is, there are no two dependencies α1→ β1 and α2→β2 in Fc such that α1 = α2.

 Fc is minimal in certain sense - it does not consist of extraneous attributes, and it combines functional dependencies with similar left side. It is cheaper to test Fc than it is to test F itself.


Related Discussions:- Define the canonical cover

Entity relationship diagram, The Enhanced Entity Relationship Diagram (ERD)...

The Enhanced Entity Relationship Diagram (ERD) produced with a drawing or case tool. Your EERD must use a ''standard'' notation style such as Crows Foot or Chen. Please note that t

Differance between unordered and ordered file, Differance between Unordered...

Differance between Unordered and ordered file ? Unordered file do no has any sequence although ordered file has arranged in a few sequence and data are assigned in ordered form

What are the advantages of logical databases, What are the advantages of Lo...

What are the advantages of Logical Databases? It offers a simple-to-use selection screens.  You can change the pre-generated selection screen to your needs.  It offers check f

What is meant by physical blocks, What is meant by Physical blocks? The...

What is meant by Physical blocks? The input and output operations are completed in block units. The blocks residing on the disk are referred to as physical blocks.

Describe the algorithm to draw the dependency graph, Describe the algorithm...

Describe the algorithm to draw the dependency graph?   Ans: Algorithm to draw Precedence Graph is like this: a.  For every transaction T i participating in schedule S, make

Write a short note on temporary tables, Write A short note on temporary tab...

Write A short note on temporary tables? Temporary Tables - Temporary tables exists solely for a particular session, or whose data persists for the duration of the transaction

Aggregation, Aggregation : One limitation of the E-R diagram is that they d...

Aggregation : One limitation of the E-R diagram is that they do not permit representation of relationships between relationships. In such a case the relationship along with its ent

What are the technique to define a schema completely, What are the techniqu...

What are the technique to define a schema completely ? A schema is completely define by DDL and DML query language.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd