seiflotfy / hyperbitbitLinks
HyperBitBit
☆134Updated 8 years ago
Alternatives and similar repositories for hyperbitbit
Users that are interested in hyperbitbit 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
- HyperLogLog cardinality estimation algorithm in go/golang!☆60Updated last year
- Quickly detect already witnessed data.☆157Updated 11 months ago
- LogLog based Cardinality Estimator☆62Updated 7 years ago
- A file backed circular buffer for Go. Mmap file into memory. Madvise to lower memory footprint.☆81Updated 7 months ago
- ☆63Updated 3 years ago
- amd64 optimized bit operations☆41Updated 7 years ago
- Bloom-filter based search index☆123Updated 3 years ago
- Experimental channel implementation☆311Updated 8 years ago
- Probabilistic Data Structures for Go☆255Updated 6 years ago
- d-left Counting Bloom Filter☆56Updated 9 years ago
- Generate datastructures for your types.☆77Updated 5 years ago
- Integer Compression Libraries for Go☆132Updated 7 years ago
- Streaming approximate histograms in Go☆176Updated 4 years ago
- Implementation of the Jump Consistent Hash algorithm in Go.☆153Updated 10 years ago
- Measure and throttle the rate at which data is transferred.☆259Updated last year
- Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams☆37Updated 8 years ago
- Fast PUT/GET/DELETE in-memory key-value store for lookaside caching☆63Updated 10 years ago
- distkv is a distributed K/V store library for Go powered by the raft consensus algorithm.☆55Updated 8 years ago
- An Adaptive Replacement Cache (ARC) written in Go.☆222Updated 5 years ago
- Software Transactional Memory in Go☆187Updated 5 years ago
- HyperLogLog++ for Go☆43Updated 7 years ago
- Go bindings for TrailDB☆47Updated 5 years ago
- [Go] seq - a gentle overview of the common ways to tackle the problem of distributed sequential IDs.☆93Updated 8 years ago
- Interesting papers I'd like to implement (or at least have implementations of)☆122Updated 4 years ago
- A fast in-memory prefix tree that uses uint64 for keys and allows for duplicate entries.☆201Updated 4 years ago
- A caching library for go that supports multiple keys and various replacement algorithms.☆159Updated 2 years ago
- Probabilistic Multiplicity Counting☆49Updated 9 years ago
- A distributed id generation service that starts at zero.☆74Updated 9 years ago
- Package pqueue provides a priority queue.☆102Updated 10 years ago