Оптимальное решение нелинейных задач бинарного программи-рования для распределённой базы данных с постоянными вре-менными характеристиками

As the performance criteria in the design of optimal logical structures of the distributed database (RDB) and local databases of metadata (LBmD) considered lows: the total time to process through a set of queries, transactions, total cumulative time queries and transactions. Appropriate setting of optimization are nonlinear integer programming problems and include the objective functions of the tracks: linear forms with binary functions from weighted scalar products of the required arguments, in the sum of quadratic forms with linear. Proposed objective function is balanced by the run-time optimization of both inquiries and transactions. In the case of permanent timing of DDB get effective exact and approximate analytical solutions defined objectives that will ensure the recommendations of the structural construction of an information system and are necessary for its databases.