Synonyms
FD
Definition
Given a relation schema R[U], a functional dependency (FD) is an expression of the form X → Y , where X,Y ⊆ U. An instance I of R[U] satisfies X → Y , denoted by I⊧X → Y , if for every two tuples t1, t2 in I, t1[X] = t2[X] implies t1[Y ] = t2[Y]. That is, whenever two tuples contain the same values for attributes in X, they must have the same values for attributes in Y. A functional dependency X → Y is called trivial if Y ⊆ X.
A key dependency is a functional dependency of the form X → U. Then X is called a superkey for relation R. If there is no proper subset Y of X such that Y is a superkey, then X is called a key.
Key Points
Functional dependencies form an important class of integrity constraints that play a critical role in maintaining the integrity of data, query optimization and indexing, and especially schema design. The focus of the normalizationtechnique in schema design is on avoiding redundancies caused by functional and other types of dependencies...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Abiteboul S, Hull R, Vianu V. Foundations of databases. Reading: Addison-Wesley; 1995.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Kolahi, S. (2018). Functional Dependency. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_1247
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1247
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering