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

DOI10.1137/0212015zbMath0512.68079OpenAlexW2011990457WikidataQ114615488 ScholiaQ114615488MaRDI QIDQ3657473

Patrick C. Fischer, D.-M. Tsou

Publication date: 1983

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0212015

zbMATH Keywords

rational database

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (3)

Compact scheme forests in nested normal form ⋮ Conditions for lossless join ⋮ I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration

This page was built for publication: Whether a Set of Multivalued Dependencies Implies a Join Dependency is NP-hard