Skip to main content

CID: A VLSI Device for Lists Intersection

  • Conference paper
Database Machines

Abstract

This paper presents a VLSI device for the intersection of lists in a database machine. We show that a better performance can be obtained by partially relaxing the strong constraints on data pipeling characteristic of systolic devices. The proposed architecture aims to intersect two unsorted lists with high degree of parallelism; moreover particular attention has been payed to maximize the utilization factor of the processors.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E.F. Codd “A Relational Model of Data for Large Shared Data Bases”, CACM 13 n. 6, June 1970.

    Google Scholar 

  2. D.C.P. Smith and G.M. Smith, “Relational Database Machines”, Computer, March 1979.

    Google Scholar 

  3. C.S. Lin, D.C.P. Smith and G.M. Smith “The Design of a Rotating Associative Memory for Relational Database Applications”, ACM TODS, vol. 1, n. 1, March 1976.

    Google Scholar 

  4. D.J. De Witt “DIRECT-A Multiprocessor Organization for Supporting Relational Database Management System”, IEEE Trans, on Comp., vol. C-28, n. 6, June 1979.

    Google Scholar 

  5. M. Missikoff “RELOB: a Relational Storage System”, 1978 ACM/SIGMOD Int. Conf. on Data Management Systems, Milano, June 1978.

    Google Scholar 

  6. M. Missikoff “A Domain Based Internal Schema for Relational Database Machines”, 1982 ACM/SIGMOD Int. Conf. on Data Management Systems, Orlando, June 1982.

    Google Scholar 

  7. L.A. Hollaar “A Design for a List Merging Network”, IEEE Trans. on Comp., vol. C-28, n. 6, June 1979.

    Google Scholar 

  8. “Arrays for Relational Data Base”, 1980 ACM/SIGMOD Int. Conf. on Management of Data, Los Angeles, May 1980.

    Google Scholar 

  9. J.L. Bentley and H.T. Kung “A Tree Machine for Searching Problems”, Proceedings of 1979 Int. Conf. on Parallel Processing IEEE, August 1979.

    Google Scholar 

  10. S.W. Song “On High Performance VLSI Solution to Database Problems”. Technical Report n. CMU-CS-81-130, Carnegie Mellon University, 1981.

    Google Scholar 

  11. M. Missikoff and M. Terranova “The architecture of DBMAC: a Relational Database Computer”, Proc. of 2d Int. Workshop on Data base Machines, San Diego, Sept. 1982.

    Google Scholar 

  12. M. Missikoff and M. Scholl “Relational Queries in a Domain Based DBMS”, Proc. of ACM/SIGMOD, San Jose, May 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bertolazzi, P., Missikoff, M., Terranova, M. (1983). CID: A VLSI Device for Lists Intersection. In: Leilich, HO., Missikoff, M. (eds) Database Machines. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69419-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-69419-6_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12959-2

  • Online ISBN: 978-3-642-69419-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics