Candidate Keys and Antichains

DOI10.1137/0601012zbMath0496.68067OpenAlexW2075948376MaRDI QIDQ3960155

Janos 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)

Related Items (10)

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

Cites Work

• A relational model of data for large shared data banks

This page was built for publication: Candidate Keys and Antichains