Interview Questions Answers.ORG
Interviewer And Interviewee Guide
Interviews
Quizzes
Home
Quizzes
Interviews Databases Programming Interviews:BtrieveClipperData ModelingData StructuresDatabase AdministrationDatabase Administrator (DBA)Database AnalystDatabase DeveloperDB DevelopmentEDI/Data Integration ExpertFirebirdHierarchicalIBM DB2InformixJava DatabaseMariaDBMicrosoft Access DeveloperMongoDBMS SQL ServerMySQL ProgrammingNetworkNoSQLObject RelationalPostgrePostgreSQLProgressRDBMSRelationalSQLSQL AdministratorSQL and PL/SQLSQL Notification ServicesSQL server 2008SSRSStored ProcedureSybaseTeradata
Copyright © 2018. All Rights Reserved
Relational Interview Question:
Explain Armstrong rules? How they are complete and/or sound?
Submitted by: AdministratorThe 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.
Submitted by: Administrator
►► 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.
Submitted by: Administrator
Copyright 2007-2024 by Interview Questions Answers .ORG All Rights Reserved.
https://InterviewQuestionsAnswers.ORG.
https://InterviewQuestionsAnswers.ORG.