Mintds
Probabilistic data structures server. The data model is key-value, where values are: Bloomfilters, LinearCounters, HyperLogLogs, CountMinSketches and StreamSummaries.
| Project Name | Stars | Downloads | Repos Using This | Packages Using This | Most Recent Commit | Total Releases | Latest Release | Open Issues | License | Language |
|---|---|---|---|---|---|---|---|---|---|---|
| Redisbloom | 1,546 | 5 months ago | 47 | other | C | |||||
| Probabilistic Datatypes Module for Redis | ||||||||||
| Sketchy | 146 | a year ago | 1 | other | Clojure | |||||
| Sketching Algorithms for Clojure (bloom filter, min-hash, hyper-loglog, count-min sketch) | ||||||||||
| Maybe | 50 |  | 1 | 1 | 5 years ago | 50 | April 23, 2019 | 1 | mit | C# |
| A class library implementing probabilistic data structures in .NET | ||||||||||
| Mintds | 25 | 1 | 8 years ago | 1 | December 29, 2015 | 6 | apache-2.0 | Java | ||
| Probabilistic data structures server. The data model is key-value, where values are: Bloomfilters, LinearCounters, HyperLogLogs, CountMinSketches and StreamSummaries. | ||||||||||
| Count Min Sketch | 21 |  | 6 | 2 | 11 years ago | 3 | July 01, 2013 | mit | JavaScript | |
| Count-Min Sketch Data Structure | ||||||||||
| Spark Algebird | 5 | 7 years ago | gpl-3.0 | Scala | ||||||
| Spark with probabilistic algortighmts - Bloom filter, HLL, QTree and Count-min sketch | ||||||||||
Alternatives To MintdsSelect To Compare
Alternative Project Comparisons
Popular Sketch Projects
Popular Bloom Filter Projects
Popular User Interface Categories
Get A Weekly Email With Trending Projects For These Categories
No Spam. Unsubscribe easily at any time.
Java
Sketch
Bloom Filter