|
Computer Science, Engineering and Control
Parallel decomposition of relational operations based on fragmented column indices
E. V. Ivanova, L. B. Sokolinskiy South Ural State University (Chelyabinsk, Russian Federation)
Abstract:
This paper is a continuation and development of the previous our work, where the decompositions of intersection and join operations for columnar indices on the basis of domain-interval fragmentation were proposed. This decomposition allows to organize the parallel execution of relational operations on the distributed columnar indices without massive data exchange between the processor nodes. In this paper the decompositions of the projection, selection, duplicate elimination and union operations are considered. Also, a new kind of columnar indices called columnar hash-indices is introduced. The columnar hash-index can index multiple attributes of a relation. For distributed columnar hash-indices, the decompositions of intersection, union, and natural join operations are considered.
Keywords:
distributed column indices, domain-interval fragmentation, column hash indices, decomposition of relational operations.
Received: 05.09.2015
Citation:
E. V. Ivanova, L. B. Sokolinskiy, “Parallel decomposition of relational operations based on fragmented column indices”, Vestn. YuUrGU. Ser. Vych. Matem. Inform., 4:4 (2015), 80–100
Linking options:
https://www.mathnet.ru/eng/vyurv66 https://www.mathnet.ru/eng/vyurv/v4/i4/p80
|
Statistics & downloads: |
Abstract page: | 168 | Full-text PDF : | 33 | References: | 32 |
|