Introduction to VLSI Systems
Systolic (VLSI) arrays for relational database operations
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
Hardware sorter and its application to data base machine
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
A single-relation module for a data base machine
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
A VLSI Implementation of the Simplex Algorithm
IEEE Transactions on Computers
On Implementing Large Binary Tree Architectures in VLSI and WSI
IEEE Transactions on Computers
A Gracefully Degradable VLSI System for Linear Programming
IEEE Transactions on Computers
A Modular Fault-Tolerant Binary Tree Architecture with Short Links
IEEE Transactions on Computers
Design and Analysis of a Generalized Architecture for Reconfigurable m-ary Tree Structures
IEEE Transactions on Computers
An Efficient Dictionary Machine Using Hexagonal Processor Arrays
IEEE Transactions on Parallel and Distributed Systems
An Efficient Implementation of Search Trees on [lg N + 1] Processors
IEEE Transactions on Computers
Hi-index | 0.02 |
A VLSI chip for performing relational data base operations is proposed. The chip is a tree of processors (TOP), where each chip has elementary storage and processing capabilities. A relation will be stored in the lowest levels of a TOP. More precisely, every m-tuple will occupy a subtree whose root is s&equil; [log2(m+1)] −1 levels above the leaves. Denoting by h the height of the tree, the upper h-s levels will be used for routing and bookkeeping purposes. A number of basic operations such as allocate and deallocate subtrees, insert and compare m-tuples etc., are defined for the TOP's. Relational operations are effectively performed as simple combinations of basic operations. The architecture of a data base machine based on TOP's is also sketched. Such a machine is feasible with the current VLSI technology and could become attractive in few years if density and performance of VLSI keep improving at the current rate.