Abstract
The Relational Database Machine VERSO uses a hardware mechanism wich filters data upon its transfer from mass memory to main memory. This paper studies the efficiency of this Filter. A probabilistic modelling approach for evaluating the Filter utilization is introduced. In order to illustrate this approach we perform the analysis for the Union operation under a simple algorithm. The modelling methodology we propose is indeed general and will be used in further studies to analyze the Filter performance on other operations, and in particular Join, which is the most critical one in a relational system.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
F. Bancilhon and M. Scholl, “Design of a Backend Processor for a Database Machine”, Proceedings of the ACM-SIGMOD Conference, Santa Monica, California, May 14–16, 1980.
F. Bancilhon, D. Fortin, S. Gamerman, J.M. Laubin, P. Richard, M. Scholl, D. Tusera and A. Verroust, “A Relational Back-end Database Machine”, Proceedings of the International Workshop on Database Machine, San Diego, California, September 1982.
J.D. Ullman, “Principles of Database Systems”, Computer Science Press, New York, 1980.
E. Cinlar, “Introduction to Stochastic Processes”, Prentice-hall, Englewood Cliffs, N.J., 1975.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gamerman, S., Salza, S., Scholl, M. (1983). Analysis of Filtering Efficiency in the Database Machine Verso. In: Leilich, HO., Missikoff, M. (eds) Database Machines. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69419-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-69419-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12959-2
Online ISBN: 978-3-642-69419-6
eBook Packages: Springer Book Archive