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

Create a new service-based database, In this assignment, you will create a ...

In this assignment, you will create a program that works with multiple tables. In this assignment, you will work with the factory and sales tables. 1. Create a new project nam

Remove partial dependancy, , write the relational schema, and draw the new ...

, write the relational schema, and draw the new dependency diagrams. Identify the normal forms for each table structure you created

Create a table for database transformation , Step 1 . Using Oracle, create ...

Step 1 . Using Oracle, create the tables identified in the preferred solution for Assignment 2. Technicians (ZipCode, TechnicianID, FirstName, LastName, Street, City, State, Home

What is system log, What is system log?  What are the entries?       An...

What is system log?  What are the entries?       Ans:  The system log that is generally written on stable storage contains the redundant data required to recover from volatile

Define- relational algebra, Define- relational algebra. The relational ...

Define- relational algebra. The relational algebra is a procedural query language. It having of a set of operations that take one or two relation as input and make a new relati

Nested queries, Nested Queries Let us see some more complex queries in ...

Nested Queries Let us see some more complex queries in this section. Sub-queries: Some of the basic concerns of sub-queries are: A sub-query is a SELECT statemen

Describe models which define the operations on classes, Describe briefly mo...

Describe briefly models which define the operations on classes. The three models which are used to define operations on classes are as: Object Model = data dictionary + Obje

What is meant by normalization of data, What is meant by normalization of d...

What is meant by normalization of data? It is a process of examining the given relation schemas based on their Functional Dependencies (FDs) and primary key to achieve the prop

Joins, how can apply joins on table

how can apply joins on table

In e-r diagram how derived attribute are represented, In E-R Diagram how de...

In E-R Diagram how derived attribute are represented ? In E-R Diagram By Dashed ellipse derived attribute are represented.

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