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

List two restrictions that are applied on the modification, List two restri...

List two restrictions that are applied on the modification (updation, insertion or deletion) of base tables through view.  Ans: The two restrictions are: 1. If a view

What is a candidate key, What is a candidate key? Minimal super keys ar...

What is a candidate key? Minimal super keys are known as candidate keys.

Define average seek time, Define average seek time. The average seek ti...

Define average seek time. The average seek time is the average of the seek times, calculated over a sequence of random requests.

desirable properties of decomposition, Desirable Properties Of Decompositi...

Desirable Properties Of Decomposition Decomposition is a process of dividing a relation into its projections that will not be disjoint. Please remind the Relational projection

The conceptual level or global level in dbms, The Conceptual Level or Globa...

The Conceptual Level or Global level The conceptual level presents a logical view of the complete database as a unified whole. It permits the user to bring all the data in th

What are stand-alone procedures, What are stand-alone procedures? Proce...

What are stand-alone procedures? Procedures that are not part of a package are called as stand-alone because they independently defined. A good example of a stand-alone procedu

What is hash file organization, What is hash file organization? What are t...

What is hash file organization? What are the causes of bucket overflow within a hash file organization? What can be completed to decrease the occurrence of bucket overflow?

What is a data dictionary, What is a data dictionary?  A data dictionar...

What is a data dictionary?  A data dictionary is a data structure which keeps Meta data about the structure of the database i.e.  the schema of the database.

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