Multivalued dependency

Multivalued dependency
In database theory, multivalued dependency is a full constraint between two sets of attributes in a relation. In contrast to the functional dependency, the multivalued dependency requires that certain tuples be present in a relation. Therefore, a multivalued dependency is a special case of tuple-generating dependency. The multivalued dependency plays a role in the 4NF database normalization.

Formal definition
The formal definition is given as follows. [1] Let be a relation schema and let multidetermines such that and ) holds on (subsets). The multivalued dependency if, in any legal relation and in , for all pairs

(which can be read as of tuples and in

, there exist tuples

such that

In more simple words the above condition can be expressed as follows: if we denote by values for and exist in collectively equal to , the tuples and should also exist in .

the tuple having

correspondingly, then whenever the tuples

Example
Consider this example of a database of teaching courses, the books recommended for the course, and the lecturers who will be teaching the course:
Course AHA AHA AHA AHA AHA AHA OSO OSO Book Lecturer

Silberschatz John D Nederpelt William M

Silberschatz William M Nederpelt John D

Silberschatz Christian G Nederpelt Christian G

Silberschatz John D Silberschatz William M

Because the lecturers attached to the course and the books attached to the course are independent of each other, this database design has a multivalued dependency; if we were to add a new book to the AHA course, we would have to add one record for each of the lecturers on that course, and vice versa. Put formally, there are two multivalued dependencies in this relation: {course} {book} and equivalently {course} {lecturer}. Databases with multivalued dependencies thus exhibit redundancy. In database normalization, fourth normal form requires that either every multivalued dependency X Y is trivial or for every nontrivial multivalued dependency X Y, X is a superkey.

Multivalued dependency

Interesting properties
If If If , Then and and , Then , then

The following also involve functional dependencies: If If , then and , then

The above rules are sound and complete. A decomposition of R into (X,Y) and (X,RY) is a lossless-join decomposition if and only if X inR. Y holds

Definitions
full constraint A constraint which expresses something about all attributes in a database. (In contrast to an embedded constraint.) That a multivalued dependency is a full constraint follows from its definition,as where it says something about the attributes . tuple-generating dependency A dependency which explicitly requires certain tuples to be present in the relation. trivial multivalued dependency 1 A multivalued dependency which involves all the attributes of a relation i.e. multivalued dependency implies, for tuples trivial multivalued dependency 2 A multivalued dependency for which . and , tuples and which are equal to and . . A trivial

References
[1] Silberschatz, Abraham; Korth, Sudarshan (2006). Database System Concepts (5th ed.). McGraw-Hill. p.295. ISBN0-07-124476-X.

External links
Multivalued dependencies and a new Normal form for Relational Databases (http://www.almaden.ibm.com/ cs/people/fagin/tods77.pdf) (PDF) - Ronald Fagin, IBM Research Lab

Article Sources and Contributors

Article Sources and Contributors

Multivalued dependency Source: http://en.wikipedia.org/w/index.php?oldid=499151230 Contributors: AutumnSnow, Cdrdata, Citral, Dweller, Emma li mk, Gromuald, Justin W Smith, Mark Renier, Michael Hardy, Mkagenius, Poa, ProveIt, R'n'B, VinceBowdren, 31 anonymous edits

License
Creative Commons Attribution-Share Alike 3.0 Unported //creativecommons.org/licenses/by-sa/3.0/