Relational Database Management System (RDBMS) Question:
Download Questions PDF

What are Armstrong rules? How do we say that they are complete and/or sound?

Answer:

The well-known inference rules for FDs
? Reflexive rule :
If Y is subset or equal to X then X Y.
► Augmentation rule:
If X Y then XZ YZ.
► Transitive rule:
If {X Y, Y Z} then X Z.
► Decomposition rule :
If X YZ then X Y.
► Union or Additive rule:
If {X Y, X Z} then X YZ.
► Pseudo Transitive rule :
If {X Y, WY Z} then WX Z.
Of these the first three are known as Amstrong Rules. They are sound because it is enough if a set of FDs satisfy these three. They are called complete because using these three rules we can generate the rest all inference rules.

Download RDBMS Interview Questions And Answers PDF

Previous QuestionNext Question
How can you find the minimal key of relational schema?What is cold backup and hot backup (in case of Oracle)?