wangyi-fudan / wyHLLLinks
The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.
☆55Updated 4 years ago
Alternatives and similar repositories for wyHLL
Users that are interested in wyHLL are comparing it to the libraries listed below
Sorting:
- Backtrace.io's resilient log record framing format☆38Updated 3 years ago
- a 64-bit histogram / quantile sketch☆59Updated 5 months ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Implementation of popular consensus protocols☆21Updated 4 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- A Wait-Free Universal Construct for Large Objects☆97Updated 5 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆118Updated 8 years ago
- Assorted notes☆84Updated last year
- An Evaluation of Linear Probing Hashtable Algorithms☆31Updated last year
- A small DFA for under 16 states☆51Updated 7 years ago
- A small test for multithreaded C++ stack unwinding on unixes☆16Updated 5 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- bit & sketches data structures☆60Updated 6 years ago
- Tiny Cooperative Process Management Library/Embedded Bounded Queue Actor Model (C11)☆40Updated 6 years ago
- ☆80Updated 3 years ago
- Non-preemptive Thread Hierarchy Manager☆55Updated 7 months ago
- Counting the collisions with perl hash tables per function☆12Updated 6 years ago
- 8-bit Xor Filter in C99☆61Updated 5 years ago
- Poireau: a sampling allocation debugger☆97Updated 3 years ago
- Fleur implements a Bloom Filter library in C that is fully compatible with DCSO's Go and python implementations.☆117Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- Batch Monitor - Gain performance by combining work from multiple threads into a single batch☆30Updated 10 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆155Updated 5 months ago
- Compact tries for fixed-width keys☆25Updated 7 years ago
- Shuffle-based predicate matcher and all-round branch free swiss army chainsaw☆17Updated 7 years ago
- Beating the `bisect` module's implementation using C-extensions.☆30Updated 2 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year