VLSI Trees for File Organization

File organization is an important field for coming VLSI applications. VLSI tree architectures seem to be most suitable to store and process files, in particular for dictionary and relational operations.

[1]  F. Leighton.  New lower bound techniques for VLSI , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[2]  David K. Hsiao,et al.  Design and Analysis of a Relational Join Operation for VLSI , 1981, VLDB.

[3]  Fabrizio Luccio,et al.  VLSI Mesh of Trees for Data Base Processing , 1983, CAAP.

[4]  Lawrence Snyder,et al.  Introduction to the configurable, highly parallel computer , 1982, Computer.

[5]  Philip L. Lehman.  A Systolic (VLSI) Array for Processing Simple Relational Queries , 1981 .

[6]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

[7]  Jeffrey Ullman,et al.  Principles of Data Base Systems , 1980 .

[8]  H. T. Kung,et al.  Systolic (VLSI) arrays for relational database operations , 1980, SIGMOD '80.

[9]  Charles E. Leiserson.  Systolic Priority Queues , 1979 .

[10]  Linda Pagli,et al.  External Sorting in VLSI , 1984, IEEE Transactions on Computers.

[11]  Franco P. Preparata,et al.  VLSI Algorithms and Architectures , 1984, MFCS.

[12]  Leslie G. Valiant,et al.  Universality considerations in VLSI circuits , 1981, IEEE Transactions on Computers.

[13]  L. Pagli,et al.  A versatile interconnection pattern laid on O(n) area , 1982 .

[14]  Fabrizio Luccio,et al.  A VLSI tree machine for relational data bases , 1983, ISCA '83.

[15]  Yasunori Dohi,et al.  Hardware sorter and its application to data base machine , 1982, ISCA 1982.

[16]  Ran Ginosar,et al.  A single-relation module for a data base machine , 1981, ISCA '81.

[17]  H. T. Kung.  VLSI Systems and Computations , 1982 .

[18]  Arnold L. Rosenberg,et al.  A Dictionary Machine (for VLSI) , 1982, IEEE Transactions on Computers.