mynameisfiber / gohllLinks
An implementation of HLL++ in go
☆70Updated 6 years ago
Alternatives and similar repositories for gohll
Users that are interested in gohll are comparing it to the libraries listed below
Sorting:
- Probabilistic Multiplicity Counting☆49Updated 9 years ago
- LogLog based Cardinality Estimator☆63Updated 7 years ago
- Probabilistic Data Structures for Go☆256Updated 7 years ago
- hokusai -- sketching streams in real-time☆78Updated 8 years ago
- Go implemetation of cuckoo filters☆28Updated 3 years ago
- Probabilistic data structures for processing very large datasets (MinHash, HyperLogLog)☆11Updated 9 years ago
- HyperBitBit☆134Updated 8 years ago
- KLL sketch: Almost Optimal Streaming Quantiles☆35Updated 9 years ago
- A mulitarmed bandit to A/B test go projects, or other languages via an API.☆71Updated 11 years ago
- Count-Min Tree Sketch: Approximate counting for NLP☆9Updated 8 years ago
- Go bindings for the Apache Lucy full text search library. The Apache Lucy search engine library provides full-text search for dynamic pro…☆47Updated 10 years ago
- Bloom filters implemented in Go.☆147Updated 7 years ago
- liblinear bindings for Go☆45Updated 6 years ago
- Probability distributions and associated methods in Go☆43Updated 10 years ago
- Streaming approximate histograms in Go☆176Updated 4 years ago
- Package stats defines a lightweight interface for collecting statistics.☆64Updated 9 years ago
- A probabilistic data structure service and storage☆92Updated 9 years ago
- gk: streaming quantiles☆45Updated 3 years ago
- A golang streaming histogram sketch. Fast quantiles and counts below a threshold.☆44Updated 2 years ago
- Fast PUT/GET/DELETE in-memory key-value store for lookaside caching☆63Updated 10 years ago
- Go library to work with PARQUET files☆47Updated 5 years ago
- Package htree implements the in-memory hash tree. Hacker News: https://news.ycombinator.com/item?id=11369676☆92Updated 2 years ago
- A file backed circular buffer for Go. Mmap file into memory. Madvise to lower memory footprint.☆81Updated 9 months ago
- A counter data structure that knows when to start estimating to save space☆34Updated 7 years ago
- Go implementation of Count-Min-Log☆67Updated 5 months ago
- High performance implementations of gradient boosting, random forests, etc. in Go☆62Updated 11 years ago
- Package atomicfile provides an atomically written/replaced file.☆51Updated 7 years ago
- S-Bitmap: Distinct Counting with a Self-Learning Bitmap☆37Updated 9 years ago
- Concurrent inverse Bloom filter.☆14Updated 10 years ago
- Hyper-Compact Virtual Estimators for Big Network Data Based on Register Sharing☆33Updated 8 years ago