Skip to main content

Advertisement

Log in

On-the-fly and background data filtering system for database architectures

  • Regular Papers
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

The discrepancy between the capacities of mass storage devices and main memory of computing systems is here to stay. The article introduces the concept of cost effective filtering with various options such as basic filter for selections, concurrent filtering extension for selections and projections, and concurrent filtering extension incorporating dynamic filtering for join, projection, and selection. After presenting these, detailed performance modeling of the filtering options is provided. Based on these performance models, a simulator is constructed and experiments for comparative filtering performance assessments are conducted. The results showed performance gains on the part of the systems employing filtering, especially in environments where high selectivities and concurrency are involved.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Babb, E., “Implementing a Relational Database by Means of Specialized Hardware,”ACM Transactions on Database Systems, Vol. 4, No. 1, pp. 1–29, 1979.

    Article  Google Scholar 

  2. Bancilhon, F. et al., “VERSO: A Relational Backend Database Machine,” inAdvanced Database Machine Architectures (Hsiao, D. K. ed.), Prentice-Hall Inc., Englewood Cliffs, New Jersey, pp. 1–18, 1983.

    Google Scholar 

  3. Dewitt, D. J. and Hawthorn, P. B., “A Performance Evaluation of Database Machine Architectures,”Proc. of Intl. Conf. on Very Large Databases, pp. 199–213, 1981.

  4. Gonzales-Rubio, R., Rohmer, J. and Terral, D., “The SCHUSS Filter: A Processor for Nonnumerical Data Processing,”Proc. of ACM SIGARCH Conf., pp. 64–73, 1984.

  5. Kiessling, W., “Tunable Dynamic Filter Algorithms for High Performance Database Systems,”Proc. of Intl. Workshop on HLCCA, pp. 10–20, 1984.

  6. Leilich, H. O. Stiege, G and Zeidler, H. C., “A Search Processor for Data Base Management Systems,”Proc, of Intl. Conf. on Very Large Databases, pp. 280–287, 1978.

  7. Oflazer, K., “A Reconfigurable VLSI Architecture for a Database Processor,”Proc. of AFIPS Conf., Vol. 52, pp. 273–281, 1983.

    Google Scholar 

  8. Ozkarahan, E. A.,Database Machines and Database Management, Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1986.

    Google Scholar 

  9. Ozkarahan, E. A., “Desirable Functionalities of Database Architectures,”Proc. of IFIP83 World Congress, pp. 357–362, 1983.

  10. Ozkarahan, E. A., “Evolution and Implementations of the RAP Database Machine,”New Generation Computing, Vol. 3, No. 3, OHMSHA Ltd. and Springer-Verlag, pp. 237–271, 1985.

    Article  Google Scholar 

  11. Ozkarahan, E. A. and Ouksel, M., “Dynamic and Order Preserving Data Partitioning for Database Machines,”Proc. of Intl. Conf. on Very Large Databases, pp. 358–368, 1985.

  12. Ozkarahan, E. A. and Bozsahin, C., “Join Strategies Using Data Space Partitioning,” to appear.

Download references

Author information

Authors and Affiliations

Authors

About this article

Cite this article

Ozkarahan, E.A., Penaloza, M.A. On-the-fly and background data filtering system for database architectures. New Gener Comput 5, 281–314 (1987). https://doi.org/10.1007/BF03037467

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037467

Keywords