Modification of Balash Algorithm to Solve the Problem of Relational Databases Normalization
The paper solves the topical problem of the modification of known algorithms for solving problems of optimal coverage taking into account the specifics of the relational model. In particular, to solve the least covering problem we have modified the well-known Balash algorithm. Numerical experiment shows a significant advantage of the modified algorithm, expressed in the acceleration of the flexing procedure.