Skip to main content

Design and Analysis of a Direct Filter Using Parallel Comparators

  • Chapter
Database Machines

Abstract

Advents in VLSI technology make it possible the development of fast hardware filters based on parallel comparators without compilation. We propose a new solution for a direct filter implementation that is efficient and extendible. It is based on a comparator array and a distributed logic for solving Boolean connectors. The filter realization is feasible using current NMOS technology in an economical way. Within a few years, up to a few hundred comparators could be integrated on a single chip. At the same time, the number of predicates that can be processed by a board can vary from 256 to a few thousand. Such a high number of predicates permits the efficient processing of important database operations. A prefilter, realized by a specialized component, extends the functionality of the filter. An analysis of our filter and comparisons with compiled filters, in particular for the case of selections and semi-joins, shows the superiority of the direct filter in various situations. These two operations are very useful in a relational database machine.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Reference

  1. Babb, E., “Implementing a Relational Database by Means of Specialized Hardware”, ACM Trans. on Database Systems, vol. 4, no. 1, March 1979, pp. 1–29.

    Article  Google Scholar 

  2. Bancilhon, F., Richard, F., School, M., “On Line Processing of Compacted Relations”, 8th International Conf. on VLDB, Mexico, September 1982.

    Google Scholar 

  3. Bancilhon F., et al., “VERSO: A Relational Back-End Database Machine”, Advanced Database Machine Architecture, Ed. by D. Hsiao, Prentice Hall, 1983, pp. 1–18.

    Google Scholar 

  4. Banerjee, J., Hsiao, D. K., and Kannan, K., “DBC - A Database Computer for Very Large Databases”, IEEE Trans. Computers, vol. C-28, no. 6, June 1979.

    Google Scholar 

  5. Boral H., DeWitt, D. J., “Database Machines: An Idea Whose Time Has Passed? A Critique of the Future of Database Machines”, IWDM, Munich, Springer Verlag Ed., September 1983

    Google Scholar 

  6. Copeland, C. P., Lipovski, G. J., and Su, S. Y. W., “The Architecture of CASSM: A Cellular System for Non-Numeric Processing”, Proc. First Annual Symposium on Computer Architecture, December 1973, pp. 121–128.

    Google Scholar 

  7. DeWitt, D. J., et al. “Implementation Techniques for Main Memory Database Systems”, ACM-SIGMOD Conf. Boston, June 1984.

    Google Scholar 

  8. Gardarin, G., Bernadat, P., Temmerman, N., Valduriez, P., Viemont, Y., “Design of a Multiprocesor Relational Database System”, IFIP World Congress, Paris, September 1983.

    Google Scholar 

  9. Gardarin, G., Faudemay, G. P., Valduriez, P., Viemont, Y. “The Content Addressable Page Manager of SABRE”, Submitted to ACM Trans. on Database Systems.

    Google Scholar 

  10. Haskin, R. L., Hollaar, L. A., “Operational Characteristics of a Hardware-based Pattern Matcher”, ACM Trans. on Database Systems, vol. 8, no. 1, March 1983.

    Article  Google Scholar 

  11. Hollaar, L. A., et al., “Architecture and Operation of a Large, Full-Text Information-Retrieval System”, Advanced Database Machine Architecture, ed. by Hslao, D. K., Prentice-Hall, 1983, pp. 256–299.

    Google Scholar 

  12. Kung, H. T., Lehman, P. L., “Systolic (VLSI) Arrays for Relational Database Operations”, Proc. ACM-SIGMOD Conference, 1980, pp. 105–116.

    Google Scholar 

  13. Ozkarahan, E. A., Schuster, S. A., Smith, K. C., “RAP-An Associative Processor for Data Base Management”, Proc. AFIPS, vol. 44, 1975, pp. 379–387.

    Article  Google Scholar 

  14. Patterson, D. A., Sequin, C. H., “Design Considerations for Single-Chip Computers in the Future”, IEEE Trans. Computers, vol. C-29, no.2February 1980, pp. 108–109.

    Article  Google Scholar 

  15. Salton, G., Fox, E. A., Wu, H., “Extended Boolean Information Retrieval”, Comm. ACM, vol. 26, no. 12, December 1983, pp. 1022–1036.

    Article  MathSciNet  MATH  Google Scholar 

  16. Schweppe, H., et al., “RDBM-A Dedicated Multiprocessor System for Database Management”, Advanced Database Machine Architecture, ed. by Hsiao, D. K., Prentice-hall, 1083, pp. 36–86.

    Google Scholar 

  17. Tanaka, Y., “A Data-stream Database Machine with Large Capacity”, Advanced Database Machine Architecture, ed. by Hslao, D. K., Prentice-Hall, 1983, pp. 168–202.

    Google Scholar 

  18. Valduriez, P., Viemont, Y., “A Multikey Hashing Scheme Using Predicate Trees”, ACM-SIGMOD Conf., Boston, June 1984.

    Google Scholar 

  19. Valduriez, P., Gardarin, G., “Join and Semi-join Algorithms for Multiprocessor Database Machines”, ACM Trans. on Database Systems, vol. 9, no. 1, March 1984.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag New York Inc.

About this chapter

Cite this chapter

Faudemay, P., Valduriez, P. (1985). Design and Analysis of a Direct Filter Using Parallel Comparators. In: DeWitt, D.J., Boral, H. (eds) Database Machines. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-5144-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-5144-6_7

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-96200-9

  • Online ISBN: 978-1-4612-5144-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics