Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Parallel Implementation of Relational Algebra Operations on a Multi-Comparand Associative Machine

In: Computing and Informatics, vol. 29, no. 3
A.s. Nempomniaschaya

Details:

Year, pages: 2010, 467 - 487
Keywords:
SIMD architecture, data parallelism, operation of the exact match, associative parallel processor, bit-serial processing, bit-parallel processing, associative parallel algorithm
About article:
In this paper, we propose a new multi-comparand associative machine (MCA-machine) and its application to relational algebra operations. We first offer a new efficient associative algorithm for the multi-comparand parallel search. It generalizes the Falkoff associative algorithm that performs a parallel search in a matrix based on the exact match with a given pattern. Then we apply the new associative algorithm to implement one group of the relational algebra operations on the MCA-machine. Then, we propose efficient associative algorithms for implementing another group of the relational algebra operations. The proposed algorithms are represented as corresponding procedures for the MCA-machine. We prove their correctness and evaluate their time complexity.
How to cite:
ISO 690:
Nempomniaschaya, A. 2010. Parallel Implementation of Relational Algebra Operations on a Multi-Comparand Associative Machine. In Computing and Informatics, vol. 29, no.3, pp. 467-487. 1335-9150.

APA:
Nempomniaschaya, A. (2010). Parallel Implementation of Relational Algebra Operations on a Multi-Comparand Associative Machine. Computing and Informatics, 29(3), 467-487. 1335-9150.