Rinda: A Relational Database Processor with Hardware Specialized for Searching and Sorting

Authors:
Ushio Inoue;Tetsuji Satoh;Haruo Hayami;Hideaki Takeda;Toshio Nakamura;Hideki Fukuoka
Affiliations:
-;-;-;-;-;-
Venue:
IEEE Micro
Year:
1991

Citing 6
Cited 2

Implementing a relational database by means of specialzed hardware

ACM Transactions on Database Systems (TODS)
Key-to-address transform techniques: a fundamental performance study on large existing formatted files

Communications of the ACM
Parallel Sorting Algorithms

Parallel Sorting Algorithms
A Compact Multiway Merge Sorter using Linear-Array Comparators

FOFO '89 Proceedings of the 3rd International Conference on Foundations of Data Organization and Algorithms
High Performance Hardware for Database Systems

Systems for Large Data Bases
Acceleration of Join Operations by a Relational Database Processor, RINDA

Proceedings of the Second International Symposium on Database Systems for Advanced Applications

Acceleration of Nonnumeric Operations Using Hardware Support for the Ordered Table Hashing Algorithms

IEEE Transactions on Computers
Parallel Intersecting Compressed Bit Vectors in a High Speed Query Server for Processing Postal

HPCA '96 Proceedings of the 2nd IEEE Symposium on High-Performance Computer Architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rinda, a database processor that accelerates nonindexed relational database queries, is described. Rinda is composed of content search processors and relational operational accelerating processors; the former, search rows stored in disk storage, and the latter sort rows stored in the main memory. The processors connect to a general-purpose host computer with channel interfaces. Performance results show that Rinda executes queries three to 100 times faster then conventional database-management system software in a benchmark system.