functional dependency

functional dependency
Name	Functional dependency
Field	Computer science; Mathematics
Related	Relational model, Database normalization, Armstrong's axioms, Closure (set theory)

functional dependency

A functional dependency is a constraint between two sets of attributes in a relation that prescribes a unique determination relationship used in Relational model design and theoretical Computer science research. It is central to Database normalization and to proofs in Finite model theory, informally expressing that one attribute set functionally determines another within a given instance or schema. The concept connects to work by researchers and institutions such as E. F. Codd, IBM, Bell Laboratories, ACM and to foundational results like Armstrong's axioms and the Chase (database) procedure.

Definition

A functional dependency specifies that for a relation schema R and attribute sets X and Y, every pair of tuples in any legal instance of R that agree on X also agree on Y; this captures a uniqueness constraint used in Relational model formulations by E. F. Codd and studies at IBM Research and Bell Laboratories. In typical notation X → Y, X is the determinant and Y is the dependent set; this notation appears in textbooks associated with Turing Award winners and curriculum at institutions such as Massachusetts Institute of Technology, Stanford University, and University of California, Berkeley. Variants and related constraints include multivalued dependencies studied in works from University of Toronto and keys defined in standards by bodies like ISO/IEC JTC 1.

Properties

Functional dependencies obey inference rules formalized by Armstrong's axioms—reflexivity, augmentation, and transitivity—developed in academic contexts including Bell Labs and proven in courses at Carnegie Mellon University. Consequences include decomposition and union rules used in schema design and in formal proofs published in journals associated with ACM SIGMOD and IEEE Transactions on Knowledge and Data Engineering. Properties such as closure, minimal cover (canonical cover), and equivalence of dependency sets are central in theoretical treatments by researchers at Princeton University and University of Oxford.

In Database Theory

In Relational model theory, functional dependencies underpin the definition of keys, superkeys, and candidate keys; these concepts were articulated by E. F. Codd and elaborated in textbooks from Addison-Wesley authors and courses at University of Illinois at Urbana–Champaign. Normal forms—Boyce–Codd normal form, Third normal form, Fourth normal form—are defined in terms of functional, multivalued, and join dependencies and were refined in conferences like VLDB and SIGMOD. The Chase (database) algorithm uses functional dependencies to test implication and lossless join decomposition, with implementations described in papers from Stanford University and University of Washington.

In Mathematics and Logic

Functional dependencies relate to notions in Set theory and Logic such as closure operators and implication systems; researchers at Harvard University and Institut des Hautes Études Scientifiques have studied algebraic characterizations. Connections to dependency theory in Category theory and to model-theoretic concepts like definability appear in work by scholars affiliated with Princeton University and Cambridge University. Algebraic treatments use lattices of closures and dependency preservation theorems akin to those in publications from Elsevier and Springer.

Detection and Algorithms

Determining implication and computing closures X+ under a set of dependencies use polynomial-time procedures taught in courses at Massachusetts Institute of Technology and implemented in systems developed at Oracle Corporation and Microsoft Research. Algorithms for minimal covers, dependency inference, and the Chase procedure are central to tools produced by projects at IBM Research and evaluated at conferences such as ICDE and PODS. Complexity results—NP-completeness and coNP bounds—appear in work from University of California, Los Angeles and ETH Zurich.

Applications and Examples

Functional dependencies guide schema normalization used in commercial systems by Oracle Corporation, Microsoft SQL Server, and PostgreSQL Global Development Group, ensuring redundancy reduction and update anomaly avoidance; example schemas are taught in courses at Columbia University and New York University. In data integration and ontology mapping, dependencies inform mappings used in projects at W3C and European Research Council funded initiatives. Example scenarios include employee-roster schemas illustrated in textbooks from Pearson Education and case studies from Kaggle competitions.

Historical Development and Notation

The idea originates in the relational theory introduced by E. F. Codd at IBM with formal notation X → Y becoming standard through publications and conferences like SIGMOD and VLDB. Subsequent formalization of inference rules and axioms credited to researchers in Bell Laboratories and universities including University of Toronto led to Armstrong's axioms and to algorithmic work by scholars at Stanford University and Carnegie Mellon University. Notational conventions and canonical covers were popularized in textbooks authored by academics affiliated with Addison-Wesley and through standards discussions at ISO/IEC JTC 1.

Category:Database theory