An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic

Yehoshua Sagiv, Claude Delobel, D. Scott Parker, Ronald Fagin

Research output: Contribution to journalArticlepeer-review

115 Scopus citations

Abstract

It is known that there is an eqmvalence between functional dependencies m a relatmonal database and a certain fragment of proposmonal logic Thins eqmvalence is extended to include both functional and multivalued dependencmes. Thus, for each dependency there is a corresponding statement m proposmonal logic. It ms then shown that a dependency (funcuonal or multivalued) is a consequence of a set of dependencies ff and only ff the corresponding proposiuonal statement ~s a consequence of the corresponding set of proposmonal statements. Examples are given to show that these techniques are valuable mn provmdmg much shorter proofs of theorems about dependencies than have been obtained by more tradmonal means It is shown that this eqmvalence cannot be extended to include either join dependencies or embedded multmvalued dependencies.

Original languageEnglish
Pages (from-to)435-453
Number of pages19
JournalJournal of the ACM
Volume28
Issue number3
DOIs
StatePublished - 1 Jul 1981
Externally publishedYes

Keywords

  • embedded multivalued dependency
  • functmonal dependency
  • join dependency
  • proposmUonal logmc
  • relational database

Fingerprint

Dive into the research topics of 'An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic'. Together they form a unique fingerprint.

Cite this