count-min-log alternatives and similar packages
Based on the "Data Structures" category.
Alternatively, view count-min-log alternatives based on common mentions on social networks and blogs.
-
go-datastructures
a collection of useful, performant, and thread-safe data structures -
gocache
A complete Go cache library with mutiple stores (memory, memcache, redis, ...), chainable, loadable, metrics cache and more. -
hyperloglog
HyperLogLog implementation with Sparse, LogLog-Beta bias correction and TailCut space reduction. -
Bloomfilter
Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go -
merkletree
Implementation of a merkle tree providing an efficient and secure verification of the contents of data structures. -
hilbert
Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves. -
gostl
Data structure and algorithm library for go, designed to provide functions similar to C++ STL. -
go-adaptive-radix-tree
A Go implementation of Adaptive Radix Tree. -
remember-go
A universal interface for caching slow database queries (backed by redis, memcached, ristretto, or in-memory). -
nan
Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers. -
cmap
a thread-safe concurrent map for go, support using interface{} as key and auto scale up shards.
Get performance insights in less than 4 minutes
Do you think we are missing an alternative of count-min-log or a related project?
Popular Comparisons
-
count-min-logvsttlcache
-
count-min-logvsgolang-set
-
count-min-logvsskiplist
-
count-min-logvscuckoofilter
-
count-min-logvsboomfilters
|
SaaSHub - Software Alternatives and Reviews
Sponsored
www.saashub.com
|
README
Count-Min-Log
TL;DR: Count-Min-Log Sketch for improved Average Relative Error on low frequency events
Count-Min Sketch is a widely adopted algorithm for approximate event counting in large scale processing. However, the original version of the Count-Min-Sketch (CMS) suffers of some deficiences, especially if one is interested in the low-frequency items, such as in text- mining related tasks. Several variants of CMS have been proposed to compensate for the high relative error for low-frequency events, but the proposed solutions tend to correct the errors instead of preventing them. In this paper, we propose the Count-Min-Log sketch, which uses logarithm-based, approximate counters instead of linear counters to improve the average relative error of CMS at constant memory footprint.
This version implements the 16 bit register version. Will add back the 8-bit version soon.
Example Usage
import cml
...
sk, err := cml.NewDefaultSketch()
sk.IncreaseCount([]byte("scott pilgrim"))
...
sk.Frequency([]byte("scott pilgrim")) // ==> 1