Information graph-based creation of parallel queries for databases

Yulia Shichkina, Dmitry Gushchanskiy, Alexander Degtyarev

Research output

1 Citation (Scopus)


The article describes the query parallelization method that takes into account the dependencies between operations in the data query. The method is based on the representation of the query as a directed graph with vertices as operations and edges as data connections. The graph is processed as an adjacency list, saving more memory than during processing a sparse adjacency matrix. The graph is modified only by operations, which do not change the elements of the adjacency list. Therefore it is possible to achieve intra-query parallelism by consideration of a request structure and implementation of mathematical methods of parallel calculations for its equivalent transformation. This article also presents an example of complex query parallelisation and describes applicability of the graph theory and methods of parallel computing both for query parallelisation and optimisation.
Original languageEnglish
Pages (from-to)475-491
JournalInternational Journal of Business Intelligence and Data Mining
Issue number4
Publication statusPublished - 2018

Fingerprint Dive into the research topics of 'Information graph-based creation of parallel queries for databases'. Together they form a unique fingerprint.

Cite this