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

Data files indices and data dictionary, The indices are accumulated in the ...

The indices are accumulated in the index files. The data is accumulated in the data files. Indices give fast access to data items. For example, a book database may be managed in th

Explain thomas write rule, Explain Thomas' Write rule.  Show how it is diff...

Explain Thomas' Write rule.  Show how it is different from timestamp ordering protol Ans: In timestamp-based concurrency control the thomas Write rule is a rule. Given a Timest

Method of analyzing association traversal, Analyzing Association Traversal ...

Analyzing Association Traversal Till now, we have supposed that associations are bi-directional. But in the case of traversal, it is in only one direction in any application,

Relational database, Convert the following ER - diagram (Entity Relationsh...

Convert the following ER - diagram (Entity Relationship Diagram) into a relational database (the primary keys are underlined): 2160_Convert the following ER - diagram into a

What is known as sequential file organization, What is known as sequential ...

What is known as sequential file organization? In the sequential file organization, the records are kept in sequential order, according to the value of a "search key" of every

What are the desirable properties of a decomposition, Define What are the d...

Define What are the desirable properties of a decomposition Ans: What are the desirable properties of decomposition - dependency preserving.  Because Lossless join and dependen

A set of possible data values is called, A set of possible data values is c...

A set of possible data values is called? A set of possible data values is called as domain.

Outer join, Outer Join: The use of Outer Join is that it still joins those...

Outer Join: The use of Outer Join is that it still joins those tuples that do not have matching values in common columns are also contained in the result table. Outer join places

Keys - relational database integrity, Candidate Key:  In a relation R, a ca...

Candidate Key:  In a relation R, a candidate key for R is a subset of the set of attributes of R, which have the differnt two properties: (1)        Uniqueness:                N

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