Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies

Yehoshua Sagiv, Scott F. Walecka*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

39 Scopus citations

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 languageEnglish
Pages (from-to)103-117
Number of pages15
JournalJournal of the ACM
Volume29
Issue number1
DOIs
StatePublished - 1 Jan 1982

Keywords

  • complete axlomatizatlon
  • complete formal theory
  • embedded multlvalued dependency
  • inference rule
  • multlvalued dependency
  • relational database
  • subset dependency

Fingerprint

Dive into the research topics of 'Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies'. Together they form a unique fingerprint.

Cite this