Min

In the article the authors define a set of algorithms required for automated assignment of primary keys in filled relational tables. The problem of assigning primary keys is formulated. Informal algorithms are proposed for assignment of primary keys in filled tables.

Structural models of relational tables and information in tabular form are considered in this article. Their similarities and distinct features were revealed. It was stated that the method of transformation of information in tabular form into relational tables was based on exclusion of information which make this model different from a the model of relational tables.

The authors consider features of traditional approach to design of relational tables in the presence of tabular style information. It was concluded that the presence of tabular style information allowed to formalize the development process. That, hence, allows to minimize the number of design errors and reduce laboriousness of formation of relational tables.