https://github.com/lemire/viewsizeestimation
Unassuming hashing-based view-size estimation techniques
https://github.com/lemire/viewsizeestimation
Last synced: 9 months ago
JSON representation
Unassuming hashing-based view-size estimation techniques
- Host: GitHub
- URL: https://github.com/lemire/viewsizeestimation
- Owner: lemire
- Created: 2015-03-12T23:11:12.000Z (over 11 years ago)
- Default Branch: master
- Last Pushed: 2023-10-14T00:17:30.000Z (almost 3 years ago)
- Last Synced: 2025-02-01T21:11:09.244Z (over 1 year ago)
- Language: C++
- Homepage:
- Size: 114 KB
- Stars: 5
- Watchers: 3
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
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 from the paper:
Kamel Aouiche and Daniel Lemire, A Comparison of Five Probabilistic View-Size Estimation Techniques in OLAP, DOLAP 2007, pp. 17-24, 2007.
http://arxiv.org/abs/cs/0703058.