Equality-Generating Dependencies

Synonyms

egd

Definition

Equality-generating dependencies, or egds, are one of the two major types of database dependencies (the other major type consists of tuple-generating dependencies, or tgds).

To define egds, it is necessary to begin with the notion of an atomic formula, where an example is the formula P(x ₁,...,x _k ), where P is a k-ary relational symbol, and x ₁,...,x _k are variables, not necessarily distinct.

Then egds are formulas of the form ∀x(ϕ(x) → (x ₁ = x ₂)), where

• 1. ϕ(x) is a conjunction of atomic formulas, all with variables among the variables in x.

• 2. Every variable in x appears in ϕ(x).

• 3. x ₁ and x ₂ are distinct variables in x.

Conditions (1) and (2) together are sometimes replaced by the weaker condition that ϕ(x) be an arbitrary first-order formula with free variables exactly those in x.

Key Points

The most important example of an egd is a functional dependency, where an example is the formula

$$\eqalign{ & \forall {x}_{1}\mathop{...}\forall {x}_{k}\forall...