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

What are stored and derived attributes, What are stored and derived attribu...

What are stored and derived attributes? Stored attributes: The attributes keeps in a data base are known as stored attributes. Derived attributes: The attributes that are de

Define rotational latency time, Define rotational latency time. The ti...

Define rotational latency time. The time spent waiting for the sector to be accessed to appear under the head is known as the rotational latency time.

What is a query tree, What is a query tree?     Ans:  A query tree, as ...

What is a query tree?     Ans:  A query tree, as well known as operator graph, is a tree data structure that corresponds to a relational algebra expression. It denotes the inpu

What is indexed sequential file organization, What is indexed sequential fi...

What is indexed sequential file organization? What are the applications of this organization?  Ans: An index file can be employed to effectively overcome the problem of storing

What is a disjoint less constraint, What is a disjoint less constraint? ...

What is a disjoint less constraint? Ans: It needs that an entity belongs to no much more than one level entity set.  Disjoint less constraint needs that an entity belongs to

File organisation and its types, File Organisation And Its Types  Just ...

File Organisation And Its Types  Just as arrays, trees, lists and other data structures are used to execute data Organisation in main memory, a number of planning's are used to

Mapping, external and internal mapping with examples

external and internal mapping with examples

Insert statement reverses storage space and transfers value, A field-groups...

A field-groups statement or an insert statement reverses storage space and transfers values. False.

What are the three data anomalies, What are the three data anomalies that a...

What are the three data anomalies that are likely to occur as a result of data redundancy?  Can data redundancy be completely eliminated in database approach?  Why or why not? A

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