Abstract
The efficiency of using the developed CW-tree data structure in comparison with the B+-tree were analyzed in this article. B+-tree is used in the popular MySQL relational database management system. It has been experimentally proven that B+-tree is not efficient for parallel data retrieval. The study of parallelizing queries with different numbers of threads showed that with an increase in the number of threads, the search speed becomes higher. However, when the number of threads is ≥4, the speed stopped changing. That means that, after four threads, there was no point in increasing the number of threads. For testing the CW-tree a separate physical drive connected via PCI-Express interface were used. The drive is INTEL MEMPEK1W016GA, it has volume of 13.41 gigabytes, its logical sector size is 512 bytes and physical sector size is 512 bytes. A database was created, filled in according to the data structure CW-tree on this intel drive. For the analysis of the CW-tree, 6 search queries were developed with different amounts of returned data. The experiment showed that executing these queries in parallel mode is faster for CW-tree than in B+-tree executing the same queries in MySQL, where B+-tree is used to index data.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call