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

A realistic approach to VLSI relational database processing

BONUCCELLI, MAURIZIO ANGELO;PAGLI, LINDA
1985

Abstract

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
Bonuccelli, MAURIZIO ANGELO; E., Lodi; F., Luccio; P., Maestrini; Pagli, Linda
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11568/6953
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact