Candidate Keys and Antichains

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1980 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Algebraic Discrete Methods, volume 1, pages 92-92 (issn: 0196-5212, eissn: 2168-345X,

Copyright policy )

Authors: János Demetrovics;

doi: 10.1137/0601012

Candidate Keys and Antichains

- Summary
- Subjects
- Metrics

Abstract

It is shown that a matrix can be constructed in which a row is determined when specified in any collection of column sets with the property that $B \subset C, A \subset B$ implies $A \subset C$. The problem of determining the minimum number of rows needed for a collection C on n rows in worst case is raised. Some bounds are given.

Keywords

Data structures, Information storage and retrieval of data, data represented by matrices

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	12
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average