FORMAL SYSTEMS FOR TUPLE AND EQUALITY GENERATING DEPENDENCIES.

C. Beeri*, M. Y. Vardi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

65 Scopus citations

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 languageEnglish
Pages (from-to)76-98
Number of pages23
JournalSIAM Journal on Computing
Volume13
Issue number1
DOIs
StatePublished - 1984

Fingerprint

Dive into the research topics of 'FORMAL SYSTEMS FOR TUPLE AND EQUALITY GENERATING DEPENDENCIES.'. Together they form a unique fingerprint.

Cite this