countminsketch | An apporximate frequency counter Redis module

countminsketch is a C library. countminsketch has no bugs, it has no vulnerabilities, it has a Strong Copyleft License and it has low support. You can download it from GitHub.

update: this project has been suspended and superceded by ===. countminsketch: an approximate items counter redis module ===. this is trivial implementation of the count min sketch (cms) from graham cormode and s. muthukrishnan as described in (approximating data with the count-min data structure)[cms is a probabilistic data structure that can be used to keep values associated with items, such as the counts of observations of samples in a stream (e.g. ip addresses, urls, etc…​). the counts are only approximated, i.e. there is a probability for error, but the data structure requires considerably less resources compared to storing all samples and their counts. this implementation employs redis' strings for storing the data structure using direct memory access and 16-bit registers. quick start guide ---. increments the count for item by value. if key does not exist, the sketch is initialized using a default width of 2000 and a depth of 10 (the defaults provide a %0.01 error at a probability of %0.01). reply: simple string, "ok".