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:
- a 64-bit histogram / quantile sketch☆59Updated 4 months ago
- Backtrace.io's resilient log record framing format☆38Updated 3 years ago
- An Evaluation of Linear Probing Hashtable Algorithms☆31Updated last year
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Implementation of popular consensus protocols☆21Updated 4 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 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
- A small DFA for under 16 states☆51Updated 6 years ago
- A learned index structure☆53Updated 4 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Quick sort code using AVX2 instructions☆69Updated 7 years ago
- Mmap radix sort file by a fixed length prefix of each line☆52Updated 5 years ago
- Assorted notes☆84Updated last year
- ☆80Updated 3 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆118Updated 8 years ago
- Non-preemptive Thread Hierarchy Manager☆55Updated 7 months ago
- Beamsplitter - A new (possibly universal) hash that passes SMHasher. Built mainly with a random 10x64 S-box. Also in NodeJS☆91Updated last month
- ☆36Updated 4 years ago
- Beating the `bisect` module's implementation using C-extensions.☆30Updated 2 years ago
- Shuffle-based predicate matcher and all-round branch free swiss army chainsaw☆17Updated 6 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- A benchmark for sorting algorithms☆60Updated 4 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- A SQLite extension for extracting values from serialized Protobuf messages☆88Updated 3 months ago
- Static Huffman coding☆10Updated 8 years ago
- bit & sketches data structures☆60Updated 6 years ago
- LLVM-jitted bitmaps☆27Updated 5 years ago
- A simple single header 64 and 32 bit hash function using only add, sub, ror, and xor.☆78Updated 3 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆155Updated 4 months ago