Available on crate feature
frequency only.Expand description
Frequency estimation algorithms
This module provides implementations of sketches for estimating item frequencies in a data stream.
§Algorithms
CountMinSketch: Classic count-min sketch with optional conservative updateSpaceSaving: Top-K / heavy hitters tracking
§Example
use flowstats::frequency::CountMinSketch;
use flowstats::traits::FrequencySketch;
let mut cms = CountMinSketch::new(0.01, 0.001); // 1% error, 0.1% probability
cms.add(b"item1", 5);
cms.add(b"item2", 3);
let count = cms.estimate(b"item1");
println!("Estimated count: {}", count);Structs§
- Count
MinSketch - Count-Min Sketch for frequency estimation
- Space
Saving std - Space-Saving algorithm for finding frequent items