Combinatorial And Algebraic Results For Database Relations

A database R has some obvious and less obvious Parameters like the number of attributes, the size Absolute value of R, the maximum size of a domain, the number of some special functional dependencies (e.g. the minimal keys), and so on. The main aim of the paper is to survey some of the results giving connections, inequalities among these parameters- Results of this type give tools to guess the structure of the database having little a priori information. The methods are of combinatorial nature.