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 calculat...

Full description

Saved in:
Bibliographic Details
Main Author: A. V. Malikov
Format: Article
Language:Russian
Published: North-Caucasus Federal University 2022-08-01
Series:Современная наука и инновации
Subjects:
Online Access:https://msi.elpub.ru/jour/article/view/277
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849244460066537472
author A. V. Malikov
author_facet A. V. Malikov
author_sort A. V. Malikov
collection DOAJ
description 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.
format Article
id doaj-art-979ea59822f845e0a5b79f59624dfb56
institution Kabale University
issn 2307-910X
language Russian
publishDate 2022-08-01
publisher North-Caucasus Federal University
record_format Article
series Современная наука и инновации
spelling doaj-art-979ea59822f845e0a5b79f59624dfb562025-08-20T03:59:09ZrusNorth-Caucasus Federal UniversityСовременная наука и инновации2307-910X2022-08-010181410.37493/2307-910X.2021.1.1276INFORMATICS, COMPUTER ENGINEERING AND MANAGEMENTA. V. Malikov0North-Caucasus Federal UniversityThe 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.https://msi.elpub.ru/jour/article/view/277bigdatab+tree индексы
spellingShingle A. V. Malikov
INFORMATICS, COMPUTER ENGINEERING AND MANAGEMENT
Современная наука и инновации
bigdata
b+tree индексы
title INFORMATICS, COMPUTER ENGINEERING AND MANAGEMENT
title_full INFORMATICS, COMPUTER ENGINEERING AND MANAGEMENT
title_fullStr INFORMATICS, COMPUTER ENGINEERING AND MANAGEMENT
title_full_unstemmed INFORMATICS, COMPUTER ENGINEERING AND MANAGEMENT
title_short INFORMATICS, COMPUTER ENGINEERING AND MANAGEMENT
title_sort informatics computer engineering and management
topic bigdata
b+tree индексы
url https://msi.elpub.ru/jour/article/view/277
work_keys_str_mv AT avmalikov informaticscomputerengineeringandmanagement