Abstract
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.
Due to the vastity of this subject, our discussion is confined to a new VLSI structure called TOT (Tree of Trees). TOT has the form of a binary tree, whose nodes are in turn binary trees. It stores tables, treated as relations in the data base sense, and performs efficiently various input, output and dictionary operations, and a complete set of relational operations. General considerations on file processing in VLSI trees stem from this discussion.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B.W. Arden and R. Ginosar, A single-relation module for a data base machine, Proc. 8-th Annual Symp. on Computer Architecture, May 1981.
J.L. Bentley and H.T. Kung, A tree machine for searching problems, Proc. IEEE Int. Conference on Parallel Processing, Bellaire, MI, August 1979.
P. Bertolazzi and F. Luccio (Eds.), “VLSI Algorithms and Architectures”, North Holland, Amsterdam 1985.
M. Bonuccelli, E. Lodi, F. Luccio, P. Maestrini and L. Pagli, A VLSI tree machine for relational data bases, Proc. 10-th Annual Symp. on Computer Architecture, Stokholm, June 1983, 67–73.
M.A. Bonuccelli, E. Lodi and L. Pagli. External Sorting in VLSI, IEEE Trans Comp. 33, 10 (1984) 931–934.
M.A. Bonuccelli, E. Lodi, F. Luccio, P. Maestrini and L. Pagli, VLSI Mesh of Trees for Data Base Processing, Proc. CAAP 83, Springer Verlag 1983.
Y. Dohi, A. Suzuki and N. Matcui, Hardware Sorter and its Application to Data Base Machine, Proc. 9-th Annual Symp. on Computer Architecture, April 1982.
IEEE Computer. Issue on “Higly Parallel Computing”, January 1982.
H.T. Kung and P.L. Lehman, Systolic (VLSI) Arrays for Relational Data Base Operations, Proc. ACM-SIGMOD 1980 Int. Conf. on Management of Data, ACM, May 1980, 105–116.
P.L. Lehman, A Systolic (VLSI) Array for Processing Simple Relational Queries, in “VLSI Systems and Computations” H.T. Kung et al. eds: Computer Science Press, Rockville, MD, 1981, 285–295.
F.T. Leighton, New Lower Bound Techniques for VLSI, Proc. 22nd Ann. Symp. Foundations of Computer Science, 1981, 1–12.
C.E. Leiserson, Systolic Priority Queues, Proc. Caltech Conf. on VLSI, 1979, 199–214.
F. Luccio and L. Pagli, A Versatile Interconnection Pattern Laid on O(n) Area, Proc. 10-th IFIP Conf. on System Modeling and Optimization, Springer Verlag 1982, 596–604.
F. Luccio, Layout and Operations for TOT’s, Tech. Rep. Dipartimento di Informatica, Pisa, Italy, 1984.
C. Mead and L. Conway, “Introduction to VLSI Systems”, Addison Wesley, Reading 1980.
M.J. Menon and D.K. Hsiao, Design and Analysis of a Relational Join Operation for VLSI, Proc. Conf. on Very Large Data Bases, August 1981.
S. Muroga, “LSI Systems Design”, Wiley, New York 1982.
T.A. Ottman, A.L. Rosenberg and L.J. Stockmeyer, A Dictionary Machine (for VLSI), IEEE Trans. Comp. 31, 9 (1982) 892–897.
R. Rice, “VLSI: The Coming Revolution in Applications and Design”, IEEE, New York 1980.
L. Snyder, Introduction to the Configurable Highly Parallel Computer, IEEE Computer 15,1 (1982) 47–56.
S.W. Song, A Highly Concurrent Tree Machine for Data Base Applications, Proc. IEEE 1980 Int. Conf. on Parallel Processing, 1980, 259–260.
J.D. Ullman, “Principles of Data Base Systems”, Pitman, London, 1980.
L.G. Valiant, Universality Considerations on VLSI Circuits, IEEE Trans. Comp., 30,2 (1981) 135–140.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Plenum Press, New York
About this chapter
Cite this chapter
Luccio, F. (1987). VLSI Trees for File Organization. In: Ghosh, S.P., Kambayashi, Y., Tanaka, K. (eds) Foundations of Data Organization. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1881-1_22
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1881-1_22
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-9048-3
Online ISBN: 978-1-4613-1881-1
eBook Packages: Springer Book Archive