seiflotfy / dlCBFLinks
d-left Counting Bloom Filter
☆56Updated 10 years ago
Alternatives and similar repositories for dlCBF
Users that are interested in dlCBF are comparing it to the libraries listed below
Sorting:
- Package htree implements the in-memory hash tree. Hacker News: https://news.ycombinator.com/item?id=11369676☆92Updated 2 years ago
- An Adaptive Replacement Cache (ARC) written in Go.☆220Updated 6 years ago
- Probabilistic Multiplicity Counting☆49Updated 10 years ago
- Fast PUT/GET/DELETE in-memory key-value store for lookaside caching☆63Updated 10 years ago
- S-Bitmap: Distinct Counting with a Self-Learning Bitmap☆37Updated 10 years ago
- hokusai -- sketching streams in real-time☆77Updated 8 years ago
- LogLog based Cardinality Estimator☆63Updated 8 years ago
- HyperBitBit☆134Updated 8 years ago
- File backed element store with caching and async writes☆56Updated 10 years ago
- A file backed circular buffer for Go. Mmap file into memory. Madvise to lower memory footprint.☆82Updated last year
- Probabilistic Data Structures for Go☆258Updated 7 years ago
- A distributed id generation service that starts at zero.☆74Updated 10 years ago
- Implementation of the Jump Consistent Hash algorithm in Go.☆153Updated 10 years ago
- Streaming approximate histograms in Go☆176Updated 4 years ago
- Package mafsa implements Minimal Acyclic Finite State Automata in Go, essentially a high-speed, memory-efficient, Unicode-friendly set of…☆295Updated 6 years ago
- Generate datastructures for your types.☆77Updated 6 years ago
- A counter data structure that knows when to start estimating to save space