Indexing Data Based on the CW-tree Algorithm Using Parallel Data Reading
Vladislav S. Shevskiy · 2020
The research objective is to develop indexing data algorithm to reduce database searching time by using multithreaded frameworks. In this article the indexing data algorithm in a tree form which is called CW-tree is supposed. Traversing through CW-tree occurs asynchronously with help additional start nodes. Compared to existing analogs of tree-based algorithms, the CW-tree has some advantages, the main of which is full parallelization both on the levels of branches and on the levels of leaves. To confirm benefits from using of CW-tree algorithm, comparison test between reading data with help B-tree and reading data with CW-tree was conducted. Result of test described in chapter 4 and shows that reading data time with CW-tree less than reading with B-tree.