Abstract

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.

Keywords

MSC

68-XX, 68U99

Cite this article

@article{cai-18126,
  author  = {Anna Shmilevna Nepomniaschaya},
  title   = {Parallel Implementation of Relational Algebra Operations on a Multi-Comparand Associative Machine},
  journal = {Computing and Informatics},
  volume  = {29},
  number  = {3},
  pages   = {467--487},
  year    = {2010},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2010/3/parallel-implementation-of-relational-algebra-operations-on-a-multi-comparand-associative-machine/}
}
Download .bib