INFORMATICS, COMPUTER ENGINEERING AND MANAGEMENT

The paper considers several combinatorial and optimization problems in Big Data systems, including the computational complexity of finding functional dependencies in the subject area and constructing a data schema, the number of combinations for recovering traversing paths on data schema is calculated, the maximum number of B + tree indexes is calculated. Algorithms for solving these problems are estimated by non-polynomial complexity functions and, in practice, heuristic methods of their optimization are usually used. An analytical function of the acceleration ofparallel data processing operations on the number ofprocessors is constructedwhich can be used in the tasks of optimal configuration ofparallel execution plans of queries to the database.A mathematical model for calculating the number ofprocessors and the level of acceleration based on the analysis of data statistics at the stages of compilation and running of queries is presented.

Abstract licence: CC BY

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.