Nambiar, KK and Radhakrishan, T and Tikekar, VG
(1983)
*Representation of functional dependencies in relational databases using linear graphs.*
In: Theoretical Computer Science, 24
(2).
pp. 143-159.

PDF
m1.pdf - Published Version Restricted to Registered users only Download (1MB) | Request a copy |

## Abstract

Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) dependency relation, (2) equipotence relation, (3) dissidence relation, (4) completion relation, and dual relations of each of them are described. Any one of these eight relations can be used to represent the functional dependencies in a database. Results from linear graph theory are found helpful in obtaining these representations. The dependency relation directly gives the functional dependencies. The equipotence relation specifies the dependencies in terms of attribute sets which functionally determine each other. The dissidence relation specifies the dependencies in terms of saturated sets in a very indirect way. Completion relation represents the functional dependencies as a function, the range of which turns out to be a lattice. Depletion relation which is the dual of the completion relation can also represent functional dependencies and similarly can the duals of dependency, equipotence, and dissidence relations. The class of depleted sets, which is the dual of saturated sets, is defined and used in the study of depletion relations.

Item Type: | Journal Article |
---|---|

Publication: | Theoretical Computer Science |

Publisher: | Elsevier Science. |

Additional Information: | Copyright of this article belongs to Elsevier Science. |

Department/Centre: | Division of Physical & Mathematical Sciences > Mathematics |

Date Deposited: | 03 Feb 2010 10:38 |

Last Modified: | 19 Sep 2010 05:37 |

URI: | http://eprints.iisc.ac.in/id/eprint/21408 |

### Actions (login required)

View Item |