pdatastructs.rs
pdatastructs.rs copied to clipboard
Simple probabilistic data structures
https://lemire.me/blog/2019/12/19/xor-filters-faster-and-smaller-than-bloom-filters/
https://arxiv.org/abs/1702.01284
https://blog.acolyer.org/2019/09/06/ddsketch/
https://blog.acolyer.org/2018/10/31/moment-based-quantile-sketches-for-efficient-high-cardinality-aggregation-queries/
https://arxiv.org/abs/1603.05346v2 https://datasketches.apache.org/docs/Quantiles/KLLSketch.html https://datasketches.apache.org/docs/Quantiles/KllSketchVsTDigest.html
The hyperloglog can get rather complex, especially when all features like bias correction, bit packing and register packing are implemented. For educational purposes, we should show the entire counter evolution...
Our data structures rely quite heavily on bit access and integer compression. `succient` seems to be rather bloated and also slow during copies. Not sure how `fixedbitset` performs. We should...