Candidate Keys and Antichains

DOI10.1137/0601012MaRDI QIDQ3960155zbMATH OpenOpenAlexFDO

Authors J. Demetrovics

Publication date 1980

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

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

zbMATH Keywords

data represented by matrices

Mathematics Subject Classification ID

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

Cites work

• A relational model of data for large shared data banks

Cited in

(10)

• Minimum matrix representation of closure operations
• Functional dependencies in relational databases: A lattice point of view
• The number of keys in relational and nested relational databases
• Minimum matrix representation of some key system
• Minimum matrix representation of Sperner systems
• Perfect error-correcting databases
• On minimum matrix representation of closure operations
• On a general class of data dependencies in the relational model and its implication problems
• Axiomatization of generalized functional dependences in relational data bases
• Some generalized type functional dependencies formalized as equality set on matrices

This page was built for publication: Candidate Keys and Antichains

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