A characterization of multivalued dependencies equivalent to a join dependency

DOI10.1016/0020-0190(84)90005-XzbMath0545.68094OpenAlexW2083290629WikidataQ114685343 ScholiaQ114685343MaRDI QIDQ797316

Y. C. Tay, Nathan Goodman

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90005-x

zbMATH Keywords

polynomial algorithmmultivalued dependenciesjoin dependencyacyclic databaseconflict-free coverdatabase schemasubset property

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (2)

Characterization of Optimal Complements of Database Views Defined by Projection ⋮ Split-freedom and MVD-intersection: A new characterization of multivalued dependencies having conflict-free covers

Cites Work

• Unnamed Item
• On the Desirability of Acyclic Database Schemes
• Power of Natural Semijoins
• On the Equivalence of Database Models
• A simplied universal relation assumption and its properties

This page was built for publication: A characterization of multivalued dependencies equivalent to a join dependency