Conference Paper

A Systolic Machine for Relational Database and Hashing

Authors:
Khaled Elleithy at University of Bridgeport
Khaled Elleithy
Magdy Bayoumi at University of Louisiana at Lafayette
Magdy Bayoumi
Lois Delcambre at Portland State University
Lois Delcambre
Download citation
To read the full-text of this research, you can request a copy directly from the authors.

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the authors.

... Figure 1 shows a DBM used as a backend processor for a conventional host. * An early version of this paper appeared in the Third Annual Parallel Processing Symposium [29]. ...
VLSI implementation of a systolic database machine for relational algebra and hashing
Article
Full-text available
  • Apr 1991
  • INTEGRATION
Database machines (DBMs) are motivated by the need for high speed query processing. Systolic arrays provide a promising future implementation for DBMs. A systolic architecture for a DBM capable of performing relational algebra operations is introduced in this paper. The array also supports the basic operations for hashing: member, insert and delete, in constant time. A VLSI implementation using a 3υ CMOS technology is analyzed. The systolic array is simple because it employs only one basic cell type. Using only one cell type reduces design time and cost and enhances reliability of DBMs.
View
ResearchGate has not been able to resolve any references for this publication.