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

Describe the types of inheritance, Describe the types of Inheritance ...

Describe the types of Inheritance 1.  Single inheritance 2.  Multiple inheritance 3.  Hierarchical inheritance 4.  Multilevel inheritance

Case study, what problems are raised by the database? why is it so controve...

what problems are raised by the database? why is it so controversial? why is data quality an issue?

Create a classification model, Use again the GE Flight Quest Data and build...

Use again the GE Flight Quest Data and build on the work done for homework 1 and 2. The goal is to create a classification model which classifies flights into "on-time" (you can de

Explain outer join, Explain outer join? Outer Join - If there are any...

Explain outer join? Outer Join - If there are any values in one table which do not have corresponding value(s) in the other, in an equi-join which will not be chosen. Such ro

Sql query for testing triggers and stored procedures , Demonstrate your kno...

Demonstrate your knowledge of PL/SQL programming by writing and thoroughly testing triggers and stored procedures associated with an e-commerce application that provides security l

Create a table to record a passengers information, Given the following rela...

Given the following relations TRAIN (NAME, START, DEST) TICKET (PNRNO., START, DEST, FARE) PASSENGER (NAME, ADDRESS, PNRNO.) Write SQL expressions for the following queries: No

What is deadlock, What is deadlock? Neither of the transaction can ever...

What is deadlock? Neither of the transaction can ever proceed with its normal implementation. This situation is known as deadlock.

What are uncommitted modifications, What are uncommitted modifications? ...

What are uncommitted modifications? The immediate-modification technique permits database modifications to be output to the database whereas the transaction is still in the act

Define the notation for classes and atrributes, Define the notation for cla...

Define the notation for classes and atrributes The notation for class, attribute, and operations are shown below:     Figure: Class with attributes and operations A

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