A collision-resistant hashing algorithm for maintaining consistency in distributed nosql databases

Скорочена інформація про документ
dc.contributor.authorNikitin, V.
dc.contributor.authorE. Krуlov, E.
dc.date.accessioned2023-02-17T13:57:32Z
dc.date.available2023-02-17T13:57:32Z
dc.date.issued2022
dc.description.abstractenA distributed database is a combination of copies of databases of one or different types using computer networks. Management of such systems is transparent to end users, that cannot be said about emergency situations and certain changes in the number of nodes. Globally defined properties include consistency, availability, and allocation tolerance. They appear as a result of the need for horizontal extension, which entails the need for copies of the stored data. This is due not only to the issue of productivity, but also to the issue of availability. These two properties are diametrically opposite: technologies and methods which improve one of them, worsen automatically the condition of the other. In addition, any existing information system uses a large set of algorithms. Each algorithm is necessary to solve some problem. The latter is quite diverse: sorting, structuring and searching for data, obtaining a unique digital fingerprint from a data set. The possibilities of usage are not limited to a certain direction and only encourage researchers to seek for new ones. This includes hashing algorithms, which are widely used in databases, in checking the integrity of files and network packets. Hashing has a wide range of usage and is not limited to use only for checking integrity, but can be used as an analogue for indexing instead of balanced trees by building hash tables [1]. Despite a great diversity, new problems arise that need to be solved. With the development of data transmission and storage technologies, there is a nicessity to improve consistency support in distributed NoSQL databases. Existing hashing algorithms are deterministic and based on bitwise operations, which make it impossible to predict collisions. Thus, the main goal of developing a new algorithm is the idea of creating such an algorithm that will improve collision resistance when changing the size of input data and which will allow estimating the possible number of collisions.uk
dc.format.pagerangeС. 45-57uk
dc.identifier.citationNikitin, V. A collision-resistant hashing algorithm for maintaining consistency in distributed nosql databases / V. Nikitin, E. Krуlov // Адаптивні системи автоматичного управління : міжвідомчий науково-технічний збірник. – 2022. – № 2 (41). – С. 45-57. – Бібліогр.: 5 назв.uk
dc.identifier.doihttps://doi.org/10.20535/1560-8956.41.2022.271338
dc.identifier.urihttps://ela.kpi.ua/handle/123456789/52743
dc.language.isoenuk
dc.publisherКПІ ім. Ігоря Сікорськогоuk
dc.publisher.placeКиївuk
dc.sourceАдаптивні системи автоматичного управління : міжвідомчий науково-технічний збірник, 2022, № 2 (41)uk
dc.subjectdistributed databasesuk
dc.subjectdistributed systemsuk
dc.subjecthashinguk
dc.subjecthash functionsuk
dc.subjectconsistencyuk
dc.subjectcollision resistanceuk
dc.subject.udc004.65uk
dc.titleA collision-resistant hashing algorithm for maintaining consistency in distributed nosql databasesuk
dc.typeArticleuk

Файли

Контейнер файлів
Зараз показуємо 1 - 1 з 1
Ескіз
Назва:
ASAU_2022_2_p45-57.pdf
Розмір:
648.04 KB
Формат:
Adobe Portable Document Format
Опис:
Завантажити
Ліцензійна угода
Зараз показуємо 1 - 1 з 1
Ескіз недоступний
Назва:
license.txt
Розмір:
9.1 KB
Формат:
Item-specific license agreed upon to submission
Опис:
Завантажити

Зібрання

Адаптивні системи автоматичного управління : міжвідомчий науково-технічний збірник. – 2022. – № 2 (41)