An Associative Accelerator for Large Databases

Authors:
Pascal Faudemay;Mongia Mhiri
Affiliations:
-;-
Venue:
IEEE Micro
Year:
1991

Citing 14
Cited 2

Parallel free-text search on the connection machine system

Communications of the ACM - Special issue on parallelism
A new string search hardware architecture for VLSI

ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
Hardware memory management for large knowledge bases

Volume I: Parallel architectures on PARLE: Parallel Architectures and Languages Europe
A benchmark of NonStop SQL on the debit credit transaction

SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment

SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Content-Addressable and Associative Memory: Alternatives to the Ubiquitous RAM

Computer
A string search processor LSI

Journal of Information Processing
Parallel algorithms for the execution of relational database operations

ACM Transactions on Database Systems (TODS)
Associative and Parallel Processors

ACM Computing Surveys (CSUR)
Extended Boolean information retrieval

Communications of the ACM
Proceedings of the Sixth International Workshop on Database Machines

IWDM '89 Proceedings of the Sixth International Workshop on Database Machines
Special Function Unit for Statistical Aggregation Functions

IWDM '89 Proceedings of the Sixth International Workshop on Database Machines
Integrating Integrity Constraints with Database Filters Implemented in Hardware

IWDM '89 Proceedings of the Sixth International Workshop on Database Machines
A programming language

A programming language

Associative Processors and Memories: A Survey

IEEE Micro
A framework for scheduling parallel dbms user-defined programs on an attached high-performance computer

Proceedings of the 5th conference on Computing frontiers

Quantified Score

Hi-index	0.00

Visualization

Abstract

The RAPID-1 (relational access processor for intelligent data), an associative accelerator that recognizes tuples and logical formulas, is presented. It evaluates logical formulas instantiated by the current tuple, or record, and operates on whole relations or on hashing buckets. RAPID- 1 uses a reduced instruction set and hardwired control and executes all comparisons in a bit-parallel mode. It speeds up the database by a significant factor and will adapt to future generations of microprocessors. The principal design issues, data structures, instruction set, architecture, environments and performance are discussed.