Abstract
Several formal systems for tuple and equality generating dependencies are developed. There are three kinds of systems, based upon substitution, tuple elimination and transitivity. The authors specialize their systems to several subclasses: total dependencies, template dependencies and binary dependencies. They also show that finding a formal system for embedded multivalued dependencies is equivalent to solving the implication problem for that class.
Original language | English |
---|---|
Pages (from-to) | 76-98 |
Number of pages | 23 |
Journal | SIAM Journal on Computing |
Volume | 13 |
Issue number | 1 |
DOIs | |
State | Published - 1984 |