A realistic approach to VLSI relational database processing

We propose new algorithms for VLSI mesh of trees structures to store and to process relational data bases. It is observed that some previous approaches to this problem suffer from the limitation that a relation might not be entirely contained in a single VLSI chip. In this new proposal, relations of arbitrary size can be handled by means of several chips of fixed size, still retaining good time performances. It is shown that the time needed to perform elementary and relational operations is logarithmic in the chip size and linear in the number of chips needed to store a relation, and in the bit length of the relation elements