Multi-Comparand Associative Machine and its Application to Relational Algebra Operations

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 paral...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Datum:2010
1. Verfasser: Nepomniaschaya, A.S.
Format: Artikel
Sprache:English
Veröffentlicht: Інститут програмних систем НАН України 2010
Schlagworte:
Online Zugang:https://nasplib.isofts.kiev.ua/handle/123456789/14647
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Назва журналу:Digital Library of Periodicals of National Academy of Sciences of Ukraine
Zitieren:Multi-Comparand Associative Machine and its Application to Relational Algebra Operations / Nepomniaschaya, A.S.// Пробл. програмув. — 2010. — № 2-3. — С. 185-192. — Бібліогр.: 20 назв. — англ.

Institution

Digital Library of Periodicals of National Academy of Sciences of Ukraine
id nasplib_isofts_kiev_ua-123456789-14647
record_format dspace
spelling Nepomniaschaya, A.S.
2010-12-27T14:02:24Z
2010-12-27T14:02:24Z
2010
Multi-Comparand Associative Machine and its Application to Relational Algebra Operations / Nepomniaschaya, A.S.// Пробл. програмув. — 2010. — № 2-3. — С. 185-192. — Бібліогр.: 20 назв. — англ.
1727-4907
https://nasplib.isofts.kiev.ua/handle/123456789/14647
519.682.5
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 a group of the relational algebra operations on the MCA-machine. The proposed algorithms are represented as corresponding procedures for the MCA-machine. We prove their correctness and evaluate their time complexity.
en
Інститут програмних систем НАН України
Паралельне програмування. Розподілені системи і мережі
Multi-Comparand Associative Machine and its Application to Relational Algebra Operations
Article
published earlier
institution Digital Library of Periodicals of National Academy of Sciences of Ukraine
collection DSpace DC
title Multi-Comparand Associative Machine and its Application to Relational Algebra Operations
spellingShingle Multi-Comparand Associative Machine and its Application to Relational Algebra Operations
Nepomniaschaya, A.S.
Паралельне програмування. Розподілені системи і мережі
title_short Multi-Comparand Associative Machine and its Application to Relational Algebra Operations
title_full Multi-Comparand Associative Machine and its Application to Relational Algebra Operations
title_fullStr Multi-Comparand Associative Machine and its Application to Relational Algebra Operations
title_full_unstemmed Multi-Comparand Associative Machine and its Application to Relational Algebra Operations
title_sort multi-comparand associative machine and its application to relational algebra operations
author Nepomniaschaya, A.S.
author_facet Nepomniaschaya, A.S.
topic Паралельне програмування. Розподілені системи і мережі
topic_facet Паралельне програмування. Розподілені системи і мережі
publishDate 2010
language English
publisher Інститут програмних систем НАН України
format Article
description 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 a group of the relational algebra operations on the MCA-machine. The proposed algorithms are represented as corresponding procedures for the MCA-machine. We prove their correctness and evaluate their time complexity.
issn 1727-4907
url https://nasplib.isofts.kiev.ua/handle/123456789/14647
citation_txt Multi-Comparand Associative Machine and its Application to Relational Algebra Operations / Nepomniaschaya, A.S.// Пробл. програмув. — 2010. — № 2-3. — С. 185-192. — Бібліогр.: 20 назв. — англ.
work_keys_str_mv AT nepomniaschayaas multicomparandassociativemachineanditsapplicationtorelationalalgebraoperations
first_indexed 2025-12-02T11:58:42Z
last_indexed 2025-12-02T11:58:42Z
_version_ 1850862468215078912