A data warehouse cannot materialize all possible views, hence we must estimate quickly, accurately, and reliably the size of views to determine the best candidates for materialization. Many available techniques for view-size estimation make particular statistical assumptions and their error can be large. Comparatively, unassuming probabilistic techniques are slower, but they estimate accurately and reliability very large view sizes using little memory. We propose five unassuming hashing-based view-size estimation techniques including Stochastic Probabilistic Counting, LogLog Probabilistic Counting, Generalized Counting, Gibbons-Tirthapura, and Adaptive Counting.

More details are available at http://arxiv.org/abs/cs/0703058.