Succinctness in dependency systems

DOI10.1016/0304-3975(83)90007-5MaRDI QIDQ593796zbMATH OpenOpenAlexFDO

Authors Patrick C. Fischer, D.-M. Tsou, Jiann H. Jou

Publication date 1983

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(83)90007-5

zbMATH Keywords

succinctnessfunctional dependenciesmultivalued dependencies

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05)

Cites work

• scientific article; zbMATH DE number 3464827 (Why is no real title available?)
• A relational model of data for large shared data banks
• Decomposition of a Data Base and the Theory of Boolean Switching Functions
• Minimum Covers in Relational Database Model
• Mixed transitivity for functional and multivalued dependencies in database relations
• On the menbership problem for functional and multivalued dependencies in relational databases
• Testing for existence of a covering Boyce-Codd normal form
• The complexity of recognizing 3NF relation schemes

Cited in

(2)

• Common equivalence and size of forgetting from Horn formulae
• The algebraic structure of the densification and the sparsification tasks for CSPs

This page was built for publication: Succinctness in dependency systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q593796)