Modification of hashing algorithm to increase rate of operations in NOSQL databases

dc.contributor.authorNikitin, V.
dc.contributor.authorKrуlov, E.
dc.contributor.authorKornaga, Y.
dc.contributor.authorAnikin, V.
dc.date.accessioned2023-02-16T10:18:41Z
dc.date.available2023-02-16T10:18:41Z
dc.date.issued2021
dc.description.abstractenOptimizing the database is quite a difficult task and involves solving a range of interrelated problems. This is to ensure acceptable performance and functionality of the database, user convenience, optimization of resources consumed, for example, by the criterion of minimizing memory costs and maximizing network usage. The most important aspect of optimization is to increase the performance of the database. To increase the performance of the database, you can use general methods to increase the speed of programs, such as increasing the power of hardware, operating system configuration, optimizing the structure of external media and placing the database on them, and others. In addition, special tools are used to optimize the database, already built into. In particular, most modern relational databases have a special component - query optimizer, which allows you quickly and efficiently process selection requests and data manipulation requests. The most common way to optimize database performance is to compress the database. It optimizes the placement of database objects on external media and the return of free disk space for future use. The most common compression technology is based on differences, when a value is replaced by information about its differences from the previous value. Another type of compression technology is based on hierarchical data compression. The essence is in the encoding of individual characters with bit strings of different lengths. Indexing and hashing are used to speed up access to database data at the request of users. Indexing speeds up search operations in the database, as well as other operations that require search: delete, edit, sort. The purpose of using indexing is to speed up data retrieval by reducing the number of disk I / O operations. Another common way to organize records and access data is hashing, a technology for quick direct access to a database record based on a given value of some record field, usually a key one.uk
dc.format.pagerangeС. 39-43uk
dc.identifier.citationModification of hashing algorithm to increase rate of operations in NOSQL databases / V. Nikitin, E. Krуlov, Y. Kornaga, V. Anikin // Адаптивні системи автоматичного управління : міжвідомчий науково-технічний збірник. – 2021. – № 2 (39). – С. 39-43. – Бібліогр.: 4 назв.uk
dc.identifier.doihttps://doi.org/10.20535/1560-8956.39.2021.247395
dc.identifier.urihttps://ela.kpi.ua/handle/123456789/52674
dc.language.isoenuk
dc.publisherКПІ ім. Ігоря Сікорськогоuk
dc.publisher.placeКиївuk
dc.sourceАдаптивні системи автоматичного управління : міжвідомчий науково-технічний збірник, 2021, № 2 (39)uk
dc.subjectdatabaseuk
dc.subjectSQL databaseuk
dc.subjectNoSQL databaseuk
dc.subjectindexinguk
dc.subjectbinary treeuk
dc.subjecthashinguk
dc.subjectprime numbersuk
dc.subject.udc004.65uk
dc.titleModification of hashing algorithm to increase rate of operations in NOSQL databasesuk
dc.typeArticleuk

Файли

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