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

Describe data manipulation language, Describe Data Manipulation language ? ...

Describe Data Manipulation language ? Data Manipulation Language (DML) - A data manipulation language is a language which enables users to access or manipulate data as organize

Create the table, Question: Using the data model express the following ...

Question: Using the data model express the following queries in SQL. (a) Create the Table named "Cinema" and make the cinema_code to be the primary key of the relation and

Multi-list file organisation, Multi-list file Organisation Multi-list f...

Multi-list file Organisation Multi-list file organisation is a multi-index linked file organisation. A linked file organisation is a logical organisation where physical orderin

What is specialization, What is Specialization? Specialization: Special...

What is Specialization? Specialization: Specialization permits you to describe new types of information (new structural types or latest domains of information), although reusin

A b-tree of order how much children m has maximum, A B-tree of order how mu...

A B-tree of order how much children m has maximum ? m has maximum m mchildren in a B tree.

What is the difference between where and having clauses, What is the differ...

What is the difference between WHERE and HAVING clauses?. Predicates in the WHERE clause applies to every tuple while the predicate in the HAVING clause applies to groups.

Farm management system, draw er diagram using entities crop,employee,depart...

draw er diagram using entities crop,employee,department,plot,cultivation plan,machinery,seed,fertilizer

What do you understand by data ware house, Question 1: Define the term ...

Question 1: Define the term business intelligence tools? Briefly explain how the data from one end gets transformed into information at the other end? Definition Exp

Explain the cascadeless schedule, Explain the Cascadeless Schedule A ca...

Explain the Cascadeless Schedule A cascadeless schedule is one in which for every pair of transactions Ti and Tj like that Tj reads a data item before written by Ti, the commit

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