List the armstrong axioms for functional dependencies, Database Management System

Assignment Help:

List the Armstrong's axioms for functional dependencies.  What do you understand by soundness and completeness of these axioms?    

 Ans: The Armstrong's axioms are:

  • F1: Relexivity: If X is a set of attributes and Y ⊆ X afterwards X →Y holds.
  • F2: Augmentation: If X → Y holds and Z is a set of attributes afterwards XZ →YZ.
  • F3: Transitivity: {X → Y, Y → Z} |= {X→Z}

 

Soundness: By sound, we mean that a specified set of functional dependencies F specified on a relation schema R, any dependency which we can infer from F by using F1 by F3 holds in each relation state r of R that satisfies the dependencies in F.

Completeness: By complete, we mean that by using F1 through F3 frequently to infer dependencies until no more dependencies can be inferred results in the whole set of all possible dependencies which can be inferred from F.


Related Discussions:- List the armstrong axioms for functional dependencies

Anomalies, define anomalies and different types of anomalies with example

define anomalies and different types of anomalies with example

What is a database, What is a Database? To know what database is, we ha...

What is a Database? To know what database is, we have to start from data, which is the basic building block of any DBMS. Data: Facts, figures, statistics etc. having no pa

Horizontal Fragmentation, I want to fragment existing table using java code...

I want to fragment existing table using java code... help me..!!

Access, I have to solve a problem using access

I have to solve a problem using access

Determine the operation that do not participate to be union, 1. Which relat...

1. Which relational algebra operations do not need the participating tables to be union-compatible? Ans: Join is the relational algebra operations that do not need the particip

What is completeness constraint on generalization, What is completeness con...

What is completeness constraint on generalization? Define the variation between total and partial design constraint. Give an example each.       Ans: Completeness Constraints

Define the third normal form, Define the Third Normal Form: The third ...

Define the Third Normal Form: The third normal form (3NF) is a normal form employed in database normalization. 3NF was initially defined by E.F. Codd in 1971. Codd's definitio

What is cardinality ratio, What is Cardinality Ratio? Cardinality Rati...

What is Cardinality Ratio? Cardinality Ratios - The cardinality ratios for relationship kinds specifies the maximum number of relationship instances in which an entity can pa

Explain the term- collation, What is Collation Collation is a kind of ...

What is Collation Collation is a kind of sort order. There are majorly 3 types of sort orders, namely: i.) Dictionary case insensitive ii.)Dictionary - case sensitive

What is known as fudge factor, What is known as fudge factor? The numbe...

What is known as fudge factor? The number of partitions is enhanced by a small value called the fudge factor, which is usually 20 percent of the number of hash partitions compu

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