Extremal Theorems for Databases


We say, that a subset K of the columns of a matrix is called a key, if every two rows that agree in the columns of K agree also in all columns of the matrix. A matrix represents a Sperner system K, if the system of minimal keys is exactly K. It is known, that such a representation always exists. In this paper we show, that the maximum of the minimum number… (More)
DOI: 10.1023/A:1026162114022


6 Figures and Tables

Cite this paper

@article{Tichler2002ExtremalTF, title={Extremal Theorems for Databases}, author={Kriszti{\'a}n Tichler}, journal={Annals of Mathematics and Artificial Intelligence}, year={2002}, volume={40}, pages={165-182} }