A simplied universal relation assumption and its properties

Ronald Fagin, Alberto O. Mendelzon, Jeffrey D. Ullman

ACM Transactions on Database Systems · 1982 · 301 citations · 20 references

DOIFull text

Open access

Concepts

TL;DR

One problem concerning the universal relation assumption is the inability of known methods to obtain a database scheme design in the general case, where the real‑world constraints are given by a set of dependencies that includes embedded multivalued dependencies. The authors propose a simpler method of describing the real world using functional dependencies and a single join dependency, and they expose its relationship to classical methods. They characterize multivalued dependencies that follow from a given join dependency and join dependencies equivalent to a set of multivalued dependencies using hypergraph representations, based on a simpler method with functional dependencies and a single join dependency.

Abstract

One problem concerning the universal relation assumption is the inability of known methods to obtain a database scheme design in the general case, where the real-world constraints are given by a set of dependencies that includes embedded multivalued dependencies. We propose a simpler method of describing the real world, where constraints are given by functional dependencies and a single join dependency. The relationship between this method of defining the real world and the classical methods is exposed. We characterize in terms of hypergraphs those multivalued dependencies that are the consequence of a given join dependency. Also characterized in terms of hypergraphs are those join dependencies that are equivalent to a set of multivalued dependencies.

References

20