title: ÐÐ»Ð³Ð¾ÑÐ¸ÑÐ¼ ÑÐ°ÑÐ¿ÑÐµÐ´ÐµÐ»ÐµÐ½Ð¸Ñ Ð´Ð°Ð½Ð½ÑÑ Ð² Ð±Ð°Ð·Ðµ Ð´Ð°Ð½Ð½ÑÑ Ð±ÐµÐ· Ð¸Ð·Ð±ÑÑÐ¾ÑÐ½Ð¾ÑÑÐ¸
title: Ð²ÑÐ¿ÑÑÐºÐ½Ð°Ñ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð°Ñ ÑÐ°Ð±Ð¾ÑÐ° Ð¼Ð°Ð³Ð¸ÑÑÑÐ°
titleType: Subtitle
title: Algorithm for distributing data in a database without redundancy
Creators: name: ÐÐ»Ð¸Ð¼Ð¾Ð²Ð°, ÐÐ»ÑÐ³Ð°
Publisher: name: Ð¡Ð°Ð½ÐºÑ-ÐÐµÑÐµÑÐ±ÑÑÐ³ÑÐºÐ¸Ð¹ Ð¿Ð¾Ð»Ð¸ÑÐµÑÐ½Ð¸ÑÐµÑÐºÐ¸Ð¹ ÑÐ½Ð¸Ð²ÐµÑÑÐ¸ÑÐµÑ ÐÐµÑÑÐ° ÐÐµÐ»Ð¸ÐºÐ¾Ð³Ð¾
Year: 2024
Subjects: ÑÐ°ÑÐ¿ÑÐµÐ´ÐµÐ»ÐµÐ½Ð½Ð°Ñ Ð±Ð°Ð·Ð° Ð´Ð°Ð½Ð½ÑÑ
Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼
Ð¼ÐµÑÐ¾Ð´
Ð·Ð°Ð´Ð°ÑÐ°
ÑÐ°ÑÐ¿ÑÐµÐ´ÐµÐ»ÐµÐ½Ð¸Ðµ Ð´Ð°Ð½Ð½ÑÑ
ÑÑÐ°Ð³Ð¼ÐµÐ½Ñ
Ð±Ð°Ð·Ð° Ð´Ð°Ð½Ð½ÑÑ Ð±ÐµÐ· Ð¸Ð·Ð±ÑÑÐ¾ÑÐ½Ð¾ÑÑÐ¸
distributed database
algorithm
method
task
data distribution
fragment
non-redundant database

description: Ð ÑÐ¾Ð²ÑÐµÐ¼ÐµÐ½Ð½ÑÑ ÑÐ°ÑÐ¿ÑÐµÐ´ÐµÐ»ÐµÐ½Ð½ÑÑ Ð±Ð°Ð·Ð°Ñ Ð´Ð°Ð½Ð½ÑÑ ÑÐ°ÑÐ¿Ð¾Ð»Ð¾Ð¶ÐµÐ½Ð¸Ðµ Ð´Ð°Ð½Ð½ÑÑ Ð¾Ð¿ÑÐµÐ´ÐµÐ»ÑÐµÑÑÑ ÑÑÐ°ÑÐ¸ÑÐµÑÐºÐ¸ Ð½Ð° ÑÑÐ°Ð¿Ðµ ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐºÐ¸. ÐÐ²Ð¸Ð´Ñ Ð´Ð¸Ð½Ð°Ð¼Ð¸ÐºÐ¸ Ð¿Ð¾ÑÑÑÐ¿Ð»ÐµÐ½Ð¸Ñ Ð·Ð°Ð¿ÑÐ¾ÑÐ¾Ð² Ð¿Ð¾Ð»ÑÐ·Ð¾Ð²Ð°ÑÐµÐ»ÐµÐ¹ Ð½Ð° ÑÐ·Ð»Ñ ÑÐ°ÑÐ¿ÑÐµÐ´ÐµÐ»ÐµÐ½Ð½Ð¾Ð¹ Ð±Ð°Ð·Ñ Ð´Ð°Ð½Ð½ÑÑ ÑÑÐ°ÑÐ¸ÑÐµÑÐºÐ¾Ðµ ÑÐ°ÑÐ¿ÑÐµÐ´ÐµÐ»ÐµÐ½Ð¸Ðµ Ð´Ð°Ð½Ð½ÑÑ Ð½Ðµ Ð²ÑÐµÐ³Ð´Ð° Ð¾Ð±ÐµÑÐ¿ÐµÑÐ¸Ð²Ð°ÐµÑ Ð¾Ð¿ÑÐ¸Ð¼Ð°Ð»ÑÐ½Ð¾Ðµ ÑÐ°ÑÐ¿Ð¾Ð»Ð¾Ð¶ÐµÐ½Ð¸Ðµ ÑÑÐ°Ð³Ð¼ÐµÐ½ÑÐ¾Ð² Ð¿Ð¾ ÑÐ·Ð»Ð°Ð¼, ÑÑÐ¾ ÑÑÐµÐ·Ð¼ÐµÑÐ½Ð¾ Ð½Ð°Ð³ÑÑÐ¶Ð°ÐµÑ ÑÐµÑÑÑÑÑ Ð±Ð°Ð·Ñ Ð´Ð°Ð½Ð½ÑÑ Ð¸ Ð²ÑÐ·ÑÐ²Ð°ÐµÑ Ð·Ð°Ð¼ÐµÐ´Ð»ÐµÐ½Ð¸Ðµ Ð¾Ð±ÑÐ°Ð±Ð¾ÑÐºÐ¸ Ð·Ð°Ð¿ÑÐ¾ÑÐ¾Ð² Ð¿Ð¾Ð»ÑÐ·Ð¾Ð²Ð°ÑÐµÐ»ÐµÐ¹. ÐÐ»Ñ ÑÐµÑÐµÐ½Ð¸Ñ Ð´Ð°Ð½Ð½Ð¾Ð¹ Ð¿ÑÐ¾Ð±Ð»ÐµÐ¼Ñ Ð¿ÑÐµÐ´Ð»Ð¾Ð¶ÐµÐ½ Ð¼ÐµÑÐ¾Ð´ ÑÐ°ÑÐ¿ÑÐµÐ´ÐµÐ»ÐµÐ½Ð¸Ñ Ð´Ð°Ð½Ð½ÑÑ Ð² ÑÐ°ÑÐ¿ÑÐµÐ´ÐµÐ»ÐµÐ½Ð½Ð¾Ð¹ Ð±Ð°Ð·Ðµ Ð´Ð°Ð½Ð½ÑÑ, Ð¾ÑÐ½Ð¾Ð²Ð°Ð½Ð½ÑÐ¹ Ð½Ð° ÐºÑÐ¸ÑÐµÑÐ¸Ð¸ Ð¿Ð¾ÑÐ¾Ð³Ð° Ð¿ÐµÑÐµÑÐ°ÑÐ¿ÑÐµÐ´ÐµÐ»ÐµÐ½Ð¸Ñ. Ð ÐºÐ°ÑÐµÑÑÐ²Ðµ Ð¿Ð¾ÑÐ¾Ð³Ð° Ð²ÑÐ±ÑÐ°Ð½Ð¾ Ð¼Ð°ÐºÑÐ¸Ð¼Ð°Ð»ÑÐ½Ð¾Ðµ ÑÐ¸ÑÐ»Ð¾ Ð¾Ð±ÑÐ°ÑÐµÐ½Ð¸Ð¹ Ð¾Ñ Ð²Ð½ÐµÑÐ½Ð¸Ñ ÑÐ·Ð»Ð¾Ð² ÑÐ¾ÑÑ Ð±Ñ Ðº Ð¾Ð´Ð½Ð¾Ð¼Ñ ÑÑÐ°Ð³Ð¼ÐµÐ½ÑÑ ÑÐ°ÑÐ¿ÑÐµÐ´ÐµÐ»ÐµÐ½Ð½Ð¾Ð¹ Ð±Ð°Ð·Ñ Ð´Ð°Ð½Ð½ÑÑ. ÐÐµÑÐ¾Ð´ ÑÐµÐ°Ð»Ð¸Ð·Ð¾Ð²Ð°Ð½ Ð² Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ðµ Ð¾ÑÑÐ»ÐµÐ¶Ð¸Ð²Ð°Ð½Ð¸Ñ Ð¸Ð½ÑÐµÐ½ÑÐ¸Ð²Ð½Ð¾ÑÑÐ¸ Ð·Ð°Ð¿ÑÐ¾ÑÐ¾Ð² Ð¿Ð¾Ð»ÑÐ·Ð¾Ð²Ð°ÑÐµÐ»ÐµÐ¹, ÐºÐ¾ÑÐ¾ÑÑÐ¹ Ð¿Ð¾Ð·Ð²Ð¾Ð»ÑÐµÑ Ð¿ÑÐ¸ ÑÐ²ÐµÐ»Ð¸ÑÐµÐ½Ð¸Ð¸ ÑÐ¸ÑÐ»Ð° ÑÑÐ¾ÑÐ¾Ð½Ð½Ð¸Ñ Ð·Ð°Ð¿ÑÐ¾ÑÐ¾Ð² Ðº ÑÐ·Ð»Ð°Ð¼ Ð ÐÐ Ð¾ÑÑÑÐµÑÑÐ²Ð»ÑÑÑ Ð¿ÐµÑÐµÑÐ°ÑÐ¿ÑÐµÐ´ÐµÐ»ÐµÐ½Ð¸Ðµ ÑÑÐ°Ð³Ð¼ÐµÐ½ÑÐ¾Ð² ÑÐ°ÑÐ¿ÑÐµÐ´ÐµÐ»ÐµÐ½Ð½Ð¾Ð¹ Ð±Ð°Ð·Ñ Ð´Ð°Ð½Ð½ÑÑ Ñ ÑÑÐµÑÐ¾Ð¼ Ð¾Ð±ÑÐµÐ¼Ð¾Ð² Ð¿ÐµÑÐµÐ´Ð°Ð²Ð°ÐµÐ¼ÑÑ Ð´Ð°Ð½Ð½ÑÑ Ð¸ Ð²ÑÐµÐ¼ÐµÐ½Ð¸, Ð½ÐµÐ¾Ð±ÑÐ¾Ð´Ð¸Ð¼Ð¾Ð³Ð¾ Ð´Ð»Ñ Ð¿ÐµÑÐµÐ´Ð°ÑÐ¸ ÐµÐ´Ð¸Ð½Ð¸ÑÑ Ð´Ð°Ð½Ð½ÑÑ Ð¼ÐµÐ¶Ð´Ñ ÑÐ·Ð»Ð°Ð¼Ð¸. ÐÑÑÐ»ÐµÐ´Ð¾Ð²Ð°Ð½Ð¸Ðµ Ð¿Ð¾ÐºÐ°Ð·Ð°Ð»Ð¾, ÑÑÐ¾ Ð¿ÑÐ¸Ð¼ÐµÐ½ÐµÐ½Ð¸Ðµ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð° Ð¾Ð±ÐµÑÐ¿ÐµÑÐ¸Ð²Ð°ÐµÑ Ð¾Ð¿ÑÐ¸Ð¼Ð¸Ð·Ð°ÑÐ¸Ñ ÑÑÐµÐ´Ð½ÐµÐ³Ð¾ Ð²ÑÐµÐ¼ÐµÐ½Ð¸ Ð²ÑÐ¿Ð¾Ð»Ð½ÐµÐ½Ð¸Ñ Ð·Ð°Ð¿ÑÐ¾ÑÐ¾Ð². Ð ÑÐ»ÑÑÐ°Ðµ Ð¿Ð¾Ð»Ð½Ð¾Ð³Ð¾ Ð½ÐµÑÐ¾Ð¾ÑÐ²ÐµÑÑÑÐ²Ð¸Ñ Ð¿ÐµÑÐ²Ð¾Ð½Ð°ÑÐ°Ð»ÑÐ½Ð¾Ð³Ð¾ ÑÑÐ°ÑÐ¸ÑÐµÑÐºÐ¾Ð³Ð¾ ÑÐ°ÑÐ¿ÑÐµÐ´ÐµÐ»ÐµÐ½Ð¸Ñ Ð¸Ð½ÑÐµÐ½ÑÐ¸Ð²Ð½Ð¾ÑÑÐ¸ Ð¿Ð¾ÑÑÑÐ¿Ð»ÐµÐ½Ð¸Ñ Ð·Ð°Ð¿ÑÐ¾ÑÐ¾Ð² Ð½Ð° ÑÐ·Ð»Ñ, ÑÑÐ½ÐºÑÐ¸Ð¾Ð½Ð¸ÑÐ¾Ð²Ð°Ð½Ð¸Ðµ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð° Ð¿Ð¾Ð·Ð²Ð¾Ð»ÑÐµÑ ÑÐ¼ÐµÐ½ÑÑÐ¸ÑÑ ÑÑÐµÐ´Ð½ÐµÐµ Ð²ÑÐµÐ¼Ñ Ð²ÑÐ¿Ð¾Ð»Ð½ÐµÐ½Ð¸Ñ Ð·Ð°Ð¿ÑÐ¾ÑÐ¾Ð² Ð² ÑÐ¸ÑÑÐµÐ¼Ðµ Ð½Ð° 35%. ÐÐ»Ð³Ð¾ÑÐ¸ÑÐ¼ Ð¼Ð¾Ð¶ÐµÑ Ð±ÑÑÑ Ð¿ÑÐ¸Ð¼ÐµÐ½ÐµÐ½ Ð² ÑÐµÐ½ÑÑÐ°Ð»Ð¸Ð·Ð¾Ð²Ð°Ð½Ð½Ð¾Ð¼ Ð±Ð°Ð»Ð°Ð½ÑÐ¸ÑÐ¾Ð²ÑÐ¸ÐºÐµ Ð½Ð°Ð³ÑÑÐ·ÐºÐ¸ ÑÐ¸ÑÑÐµÐ¼Ñ ÑÐ¿ÑÐ°Ð²Ð»ÐµÐ½Ð¸Ñ ÑÐ°ÑÐ¿ÑÐµÐ´ÐµÐ»ÐµÐ½Ð½ÑÐ¼Ð¸ Ð±Ð°Ð·Ð°Ð¼Ð¸ Ð´Ð°Ð½Ð½ÑÑ.
description: In modern distributed databases, the location of the data is determined statically during the design phase. Due to the dynamics of user requests arriving at distributed database nodes, static data distribution does not always ensure the optimal arrangement of fragments across nodes, which excessively loads database resources and slows down the processing of user requests. To solve this problem, a method for distributing data in a distributed database is proposed, based on the redistribution threshold criterion. The maximum number of requests from external nodes to at least one fragment of the distributed database was selected as the threshold. The method is implemented in an algorithm for tracking the intensity of user requests, which allows, as the number of third-party requests to nodes of a distributed database increases, to redistribute fragments of a distributed database, taking into account the volume of transmitted data and the time required to transfer a unit of data between nodes. The study showed that the use of the algorithm optimizes the average query execution time. In the event of a complete discrepancy between the initial static distribution of the intensity of requests arriving at nodes, the operation of the algorithm makes it possible to reduce the average time for executing requests in the system by 35%. The algorithm can be applied in a centralized load balancer of a distributed database management system.