Define the canonical cover, Database Management System

Assignment Help:

Define the Canonical cover

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

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

F_c 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 F_c than it is to test F itself.

Related Discussions:- Define the canonical cover

What is difference among mysql_connect and mysql_pconnect, What is differen...

What is difference among mysql_connect and mysql_pconnect? Mysql_connect() opens a new connection to the database while mysql_pconnect() opens persistent connection to the data

Data dictionary, how to prepare a data dictionary for online examination sy...

how to prepare a data dictionary for online examination system for certified courses?

Design a gennalization and specialization hierarchy for an a, Design a genn...

Design a gennalization and specialization hierarchy for an automobile sales company

What is null, What is NULL? Simply NULL means not in value.

What is NULL? Simply NULL means not in value.

Example of sequences, Example : Create a sequence named SEQSS that starts a...

Example : Create a sequence named SEQSS that starts at 105, has a step of 1 and can take maximum value as 2000. CREATE SEQUENCE SEQSS START WITH 105 INCREMENT BY 1 MAX VA

What is an index, What is an index? An index is a structure that helps ...

What is an index? An index is a structure that helps to place desired records of a relation quickly, without probing all records.

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

Define the traditional system analysis and design, Define the Traditional S...

Define the Traditional System Analysis and Design Traditional System Analysis and Design (SAD) have three basic life cycle models. A typical software lifecycle consists of the

Types of online analytical processing tools, Describe the various types of ...

Describe the various types of Online Analytical Processing (OLAP) tools and briefly discuss how the support common analytical operations.

Ideal data dictionary, An ideal data dictionary should have everything a DB...

An ideal data dictionary should have everything a DBA wants to know about the database. 1 Conceptual, External, and internal database descriptions. 2. Descriptions of attr

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages