The characterization of branching dependencies

The characterization of branching dependencies

0.00 Avg rating0 Votes
Article ID: iaor19931437
Country: Netherlands
Volume: 40
Issue: 2
Start Page Number: 139
End Page Number: 153
Publication Date: Dec 1992
Journal: Discrete Applied Mathematics
Authors: , ,
Keywords: computers: data-structure, Computers: data structure
Abstract:

A new type of dependencies in a relational database model is introduced. If b is an attribute, A is a set of attributes then it is said that equ1-depends on A, in notation equ2, in a database r if there are no equ3rows in r such that they have at most p different values in A, but equ4different values in b. equ5-dependency is the classical functional dependency. Let equ6(A) denote the set equ7. The set function equ8(A) is characterized if equ9. Implications among equ10-dependencies are also determined.

Reviews

Required fields are marked *. Your email address will not be published.