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

Database incident table, The Incident table, with an auto-incrementing in...

The Incident table, with an auto-incrementing incident number, etc, looks like: incident_num reporter date time incide

Concurrency control, discuss the purpose of the concurrency control?

discuss the purpose of the concurrency control?

Modelling and normalisation, Task Part A. Create an ERD from a business pro...

Task Part A. Create an ERD from a business problem. (50 marks) Read the following problem and complete the tasks listed below. THE ABS Blood Bank Australian Blood Services (ABS) i

Explain about sql server 2000, What is the difference between SQL Server 2...

What is the difference between SQL Server 2000 complete and differential backups? A complete backup makes a copy of the whole database. A differential backup creates a copy of

Explain the dynamic hashing techniques, Explain the Dynamic Hashing Techniq...

Explain the Dynamic Hashing Techniques There are two methods in it: extendible hashing - stores an access structure in addition to the file, and therefore is somewhat identica

What is candidate key, What is candidate key? Candidate Key - A candi...

What is candidate key? Candidate Key - A candidate key of an entity set is a minimal superkey, which uniquely identifies each row in the relation.

Explain transaction, What is transaction? Collections of operations tha...

What is transaction? Collections of operations that form a single logical unit of work are known as transactions.

Relational algebra operators, Question 1 Draw a Data Flow Diagram for a...

Question 1 Draw a Data Flow Diagram for a University scenario Question 2 Discuss the following with suitable examples Relational Algebra Operators Database Pla

How does the two phase protocol ensure serializability, How does the two ph...

How does the two phase protocol ensure serializability in database schedules?   Ans:  A transaction is termed to follow the two-phase locking protocol if all locking operations

Explain how you can define an object model of a system, Explain how you can...

Explain how you can define an object model of a system. A list of terms that shall be used by end users to describe state and behaviour of objects in system.   Different use

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