Synonyms
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, which is a formula of the form P(x 1,...,x k ), where P is a k-ary relational symbol and x 1,…,x k are variables, not necessarily distinct.
Then egds are formulas of the form ∀x(ϕ(x) → (x 1 = x 2)), where:
Ï•(x) is a conjunction of atomic formulas, all with variables among the variables in x.
Every variable in x appears in Ï•(x).
x 1 and x 2 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
Recommended Reading
Beeri C, Vardi MY. A proof procedure for data dependencies. J ACM. 1984;31(4):718–41.
Codd EF. Further normalization of the data base relational model. In: Database systems, Courant computer science series 6. Englewood Cliffs: Prentice-Hall; 1972. p. 33–64.
Fagin R. Horn clauses and database dependencies. J ACM. 1982;29(4):952–85.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2017 Springer Science+Business Media LLC
About this entry
Cite this entry
Fagin, R. (2017). Equality-Generating Dependencies. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_1273-2
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7993-3_1273-2
Received:
Accepted:
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4899-7993-3
Online ISBN: 978-1-4899-7993-3
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering