Creating a comparison method for relational tables

Article Sidebar

PDF (Русский)
Published: 01.08.2019
UDC 004.622 004.658.6
DOI: https://doi.org/10.26907/1562-5419-2019-22-3-173-183
Issue
Vol. 22 No. 3 (2019)

Main Article Content

Азат Шавкатович Якупов
LLC “Piano”
Даниил Андреевич Клинов
LLC “deLion”

Abstract

The article is devoted to creating a quick method of comparing a huge amount of data tables in relational database management systems. Creating an effective method for comparing relational systems is really relevant today. The study of existing solutions was conducted. The algorithm in this article was created using the probabilistic data structure «Countable Bloom filter» and the Monte Carlo Method. The proposed solution is unique in its direction, as it uses the least amount of temporary resources. A probabilistic model of the created algorithm is constructed, this algorithm can be used for parallelization.

Article Details

Author Biographies

Азат Шавкатович Якупов

Assistant at the department of “Software engineering” HS ITIS, senior of database developing.

Даниил Андреевич Клинов

The bachelor of HS ITIS in the direction “Applied informatics”, junior of database developing.

References

Birialtsev E. Intelligent search in Big Data [Text] // Approach to Data Integration. 2017. V. 46. No 19. P. 7–14.
Chen G., Guo D., Luo L., Ren B. Optimization of multicast source routing based on bloom filter // IEEE Communication Letters. 2018. No 4. P. 700–703.
Kareev I. Lower bounds for expected sample size of sequential procedures for the multinomial selection problems // Communications in Statistics. 2017. V. 913. No 1. P. 1–29.
Wu K., Tan H., Liu Y., Zhang J., Zhang Q., Ni L. Side channel: Bits over interference // IEEE Transactions on Mobile Computing. 2017. No 8. P. 1317–1330.
Афанасьев Г.И., Марков А.Д. База Данных NoSql и их сравнение с традиционными базами данных // Теория Инноваций. 2017. № 5-2. С. 4–10.
Официальная документация к инструменту сравнения таблиц РСУБД “Devart” [Электронный ресурс]. Режим доступа: https://www.devart.com (Дата обращения: 19.11.2018).
Официальная документация к инструменту сравнения таблиц РСУБД “Idera” [Электронный ресурс]. Режим доступа: https://www.idera.com (Дата обращения: 17.01.2019).
Официальная документация к инструменту сравнения таблиц РСУБД “Red Gate” [Электронный ресурс]. Режим доступа: https://www.red-gate.com (Дата обращения: 11.11.2018).
Официальная документация к инструменту сравнения таблиц РСУБД “SQL Delta” [Электронный ресурс]. Режим доступа: https://www.sqldelta.com (Дата обращения: 04.12.2018).
Официальная документация к инструменту сравнения таблиц РСУБД “SQL Manager” [Электронный ресурс]. Режим доступа: https://www.sqlmanager. net (Дата обращения: 03.12.2018).
Официальная документация РСУБД “Oracle Database” [Электронный ресурс]. Режим доступа: https://www.oracle.com/ru/database/ (Дата обращения: 10.02.2019).
Сайт DB-engines [Электронный ресурс]. Режим доступа: https://db-engines.com/en/ranking_trend (дата обращения 27.04.2019).
Сайт Seagate [Электронный ресурс]. Режим доступа: https://www. seagate.com/files/www-content/our-story/trends/files/idc-seagate-dataage-whitepaper.pdf (дата обращения: 25.04.2019).
Сайт Searchqlserver [Электронный ресурс]. Режим доступа: https://searchsqlserver.techtarget.com/definition/database (дата обращения: 23.05.2019)
Сайт W3techs. Trends in the usage of server-side languages for websites [Электронный ресурс]. Режим доступа: https://w3techs.com/ technologies/ history_overview/programming_language/m s/y (дата обращения 15.04.2019).
Тишин А.О. Разработка базы данных завершенных проектов // Евразийский научный журнал. 2017. № 5. С. 456–457.


Presenting an article for publication in the Russian Digital Libraries Journal (RDLJ), the authors automatically give consent to grant a limited license to use the materials of the Kazan (Volga) Federal University (KFU) (of course, only if the article is accepted for publication). This means that KFU has the right to publish an article in the next issue of the journal (on the website or in printed form), as well as to reprint this article in the archives of RDLJ CDs or to include in a particular information system or database, produced by KFU.

All copyrighted materials are placed in RDLJ with the consent of the authors. In the event that any of the authors have objected to its publication of materials on this site, the material can be removed, subject to notification to the Editor in writing.

Documents published in RDLJ are protected by copyright and all rights are reserved by the authors. Authors independently monitor compliance with their rights to reproduce or translate their papers published in the journal. If the material is published in RDLJ, reprinted with permission by another publisher or translated into another language, a reference to the original publication.

By submitting an article for publication in RDLJ, authors should take into account that the publication on the Internet, on the one hand, provide unique opportunities for access to their content, but on the other hand, are a new form of information exchange in the global information society where authors and publishers is not always provided with protection against unauthorized copying or other use of materials protected by copyright.

RDLJ is copyrighted. When using materials from the log must indicate the URL: index.phtml page = elbib / rus / journal?. Any change, addition or editing of the author's text are not allowed. Copying individual fragments of articles from the journal is allowed for distribute, remix, adapt, and build upon article, even commercially, as long as they credit that article for the original creation.

Request for the right to reproduce or use any of the materials published in RDLJ should be addressed to the Editor-in-Chief A.M. Elizarov at the following address: amelizarov@gmail.com.

The publishers of RDLJ is not responsible for the view, set out in the published opinion articles.

We suggest the authors of articles downloaded from this page, sign it and send it to the journal publisher's address by e-mail scan copyright agreements on the transfer of non-exclusive rights to use the work.