The Application of Graph Theory and Adjacency Lists to Create Parallel Queries to Relational Databases
The increase in the volume of processed data and the requirements for accuracy and speed of their processing has been observed in the world. Therefore, the problem of finding effective methods for accelerating the execution of queries with the involvement of all possible software, mathematical and hardware tools is becoming increasingly important. This article presents the results of the authors’ research in the field of creating parallel queries. These results can be used in practice to implement relational queries and in theory to improve the methods of parallelizing queries. In the article are considered various ways of performance of a complex queries both in sequential, and in a parallel type. It is proposed to use the theory of parallel computations for the transformation of queries. The results of numerical experiments confirming the authors’ assumptions are presented at the end of the article.
KeywordsDatabase Query Parallel computing Information graph Adjacency lists
The paper has been prepared within the scope of the state project “Initiative scientific project” of the main part of the state plan of the Ministry of Education and Science of Russian Federation (task № 2.6553.2017/8.9 BCH Basic Part).
- 8.Waluyo, A.B., Srinivasan, B., Taniar, D.: Research in mobile database query optimization and processing. Mob. Inf. Syst. 1(4), 225–252 (2005)Google Scholar
- 13.Shichkina, Y.A., Kupriyanov, M.S.: Applying the list method to the transformation of parallel algorithms into account temporal characteristics of operations. In: Proceedings of the 19th International Conference on Soft Computing and Measurements, SCM 2016, pp. 292–295 (2016). 7519759Google Scholar