阿姆斯特朗数_阿姆斯特朗的功能依赖公理 数据库管理系统

阿姆斯特朗数

Armstrong axioms are a complete set of inference rules or axioms, introduced and developed by William W. Armstrong in 1974. The inference rules are sound which is used to test logical inferences of functional dependencies. The axiom which also refers to as sound is used to infer all the functional dependencies on a relational database. The Axioms are a set of rules, that when applied to a specific set, generates a closure of functional dependencies.

Armstrong公理是由William W. Armstrong在1974年引入和开发的一整套推理规则或公理。推理规则是健全的，用于测试功能依赖项的逻辑推理。 也称为声音的公理用于推断关系数据库上的所有功能依赖性。 公理是一组规则，当将其应用于特定集合时，会生成功能依赖关系的闭包。

Armstrong's Axioms has two different set of rules,

阿姆斯特朗公理有两个不同的规则集，

1. Axioms or primary rules

   公理或主要规则

   1. Axiom of Reflexivity
   2. Axiom of Augmentation
   3. Axiom of Transitivity

2. Additional rules or Secondary rules

   附加规则或辅助规则

   1. Union
   2. Composition
   3. Decomposition
   4. Pseudo Transitivity

1) Axioms or primary rules

1)公理或主要规则

Let suppose T (k) with the set of attributes k be a relation scheme. Subsequently, we will represent subsets of k as A, B, C. The standard notation in database theory for the set of attributes is AB rather than A∪B.

让与该组属性的假设T(k)的 k为一个关系模