Skip to content

Implement frequency algorithms

Pre-release
Pre-release
Compare
Choose a tag to compare
@gakhov gakhov released this 27 Aug 14:09
· 6 commits to master since this release
0.5.0
e72a20e

NEW

  • Count Sketch algorithm implementation
  • Count-Min Sketch algorithm implementation

Count Sketch and Count–Min Sketch are simple space-efficient probabilistic data structures
that are used to estimate frequencies of elements in data streams and can address the Heavy hitters problem.

Count Sketch was proposed by Moses Charikar, Kevin Chen, and Martin Farach-Colton in 2002.
Count–Min Sketch was presented in 2003 by Graham Cormode and Shan Muthukrishnan and published in 2005.

Assets 2
Loading