Whether a Set of Multivalued Dependencies Implies a Join Dependency is NP-hard

Whether a Set of Multivalued Dependencies Implies a Join Dependency is NP-hard

The problem of determining, given a set of multivalued dependencies, whether or not they logically imply a given join dependency is shown to be computationally intractable.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on computing 1983-05, Vol.12 (2), p.259-266
Hauptverfasser: Fischer, Patrick C., Tsou, Don-Min
Format: Artikel
Sprache:eng
Schlagworte:
Dependency theory
Relational data bases
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The problem of determining, given a set of multivalued dependencies, whether or not they logically imply a given join dependency is shown to be computationally intractable.
ISSN:0097-5397
1095-7111
DOI:10.1137/0212015