A universal formalism to express decompositions, functional dependencies and other constraints in a relational database

DOI10.1016/0304-3975(82)90057-3zbMath0503.68072OpenAlexW2032009002WikidataQ114683737 ScholiaQ114683737MaRDI QIDQ1173417

S. Singh

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90057-3

zbMATH Keywords

data dependencydecomposition of relationsdecidability of implication problemgeneral dependency

Mathematics Subject Classification ID

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

Cites Work

• The interaction of integrity constraints in an information system
• A Complete Axiomatization of Full Join Dependencies
• A relational model of data for large shared data banks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item