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

Which operation is used if we are interested certain columns, Which operati...

Which operation is used if we are interested in only certain columns of a table? PROJECTION operation is used if we are interested in only certain columns of a table.

In which form of relational database developer refers, In which form of rel...

In which form of relational database developer refers to a record? In a tuple form of relational database developer refers to a record.

Difference among a primary index and a secondary index, What is the differe...

What is the difference among a primary index and a secondary index? Primary Index: A primary index is an ordered file whose records are of fixed length along with two fields.

Differentiate between strict and rigorous two phase locking, Differentiate ...

Differentiate between strict two-phase and rigorous two-phase with conversion protocol Ans:  Strict two-phase locking holds all its exclusive that is write locks until commit t

Draw entity-relationship diagram of database, Read the description below a...

Read the description below and draw an Entity-Relationship diagram for it. You must use the symbols described in the course materials. This database will help the Parents Assocc

Describe the ways for selecting data structure, Ways for Selecting Data Str...

Ways for Selecting Data Structure Algorithms operate on data structure. Therefore, selection of the best algorithm means selecting the best data structure from whole bunch. Th

Explain controlled redundancy, Explain controlled redundancy? Controll...

Explain controlled redundancy? Controlled redundancy : The replication of data within the data warehouse for the purposes of improved data access or understand ability.

Define the terms ddl and dml, Define the terms i) DDL ii) DML DDL: Data...

Define the terms i) DDL ii) DML DDL: Data base schema is particular by a set of definitions expressed by a special language known as a data definition language. DML: A data

What are the drawbacks of shadow-paging technique, What are the drawbacks o...

What are the drawbacks of shadow-paging technique? The drawbacks of shadow paging is:- a) Commit Overhead b) Data fragmentation c)  Garbage collection

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