Investigation of some hardware accelerators for relational algebra operations

Authors:
A. Sh. Nepomniaschaya;Ya. I. Fet
Affiliations:
-;-
Venue:
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Year:
1995

Citing 9
Cited 0

Database machines and database management

Database machines and database management
LUCAS associative array processor: design, programming and application studies

LUCAS associative array processor: design, programming and application studies
Fast algorithms and their implementation on specialised parallel computers

Fast algorithms and their implementation on specialised parallel computers
Data compression: methods and theory

Data compression: methods and theory
Cellular array architecture for relational database implementation

Future Generation Computer Systems
Algorithms for Parallel-Search Memories

Journal of the ACM (JACM)
Associative Computing: A Programming Paradigm for Massively Parallel Computers

Associative Computing: A Programming Paradigm for Massively Parallel Computers
Principles of Database Systems

Principles of Database Systems
Content Addressable Parallel Processors

Content Addressable Parallel Processors

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is devoted to the application of specialized processors for speeding-up the realization of relational algebra operations on fine-grain SIMD computers. A short description of two processors is presented. By means of a special high level language STAR, the algorithms of implementation of relational algebra operations are described in a STARAN-like computer model, and then in the same model with attached processors. The comparison is made, corroborating the efficiency of the proposed co-processors.