Paper Info
Title
The characterization of branching dependencies
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 b ( p,q )-depends on A , in notation A (p,q) → b , in a database r if there are no q + 1 rows in r such that they have at most p different values in A , but q + 1 different values in b . (1,1)-dependency is the classical functional dependency. Let I ( A ) denote the set{ b : A (p,q) → b . The set function I ( A ) is characterized if p =1, 1< q ; p =2, 3< q ; 2< p , p 2 − p −1< q . Implications among ( p,q )-dependencies are also determined.
Year
DOI
Venue
1992
10.1016/0166-218X(92)90027-8
Discrete Applied Mathematics
Field
DocType
Volume
Row,Set function,Discrete mathematics,Combinatorics,Notation,Relational database,Functional dependency,Relational model,Mathematics,Branching (version control)
Journal
40
Issue
ISSN
Citations 
2
Discrete Applied Mathematics
16
PageRank 
References 
Authors
0.88
2
3
Name
Order
Citations
PageRank
János Demetrovics1414163.60
Gyula O. H. Katona226466.44
Attila Sali316624.30