Abstract
It is shown that a subclass of subset dependenoes (that does not include all the embedded multwalued dependenoes) has a complete axlomatlzation consisting of reflexivity and transltivity rules As a result, it is shown how to test implications of embedded muluvalued dependencies under some restricted conditions.
Original language | English |
---|---|
Pages (from-to) | 103-117 |
Number of pages | 15 |
Journal | Journal of the ACM |
Volume | 29 |
Issue number | 1 |
DOIs | |
State | Published - 1 Jan 1982 |
Keywords
- complete axlomatizatlon
- complete formal theory
- embedded multlvalued dependency
- inference rule
- multlvalued dependency
- relational database
- subset dependency