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 9 months ago
- Wolfsort is a stable adaptive hybrid radix / merge sort.☆197Updated last year
- Backtrace.io's resilient log record framing format☆40Updated 3 years ago
- Beamsplitter - A new (possibly universal) hash that passes SMHasher. Built mainly with a random 10x64 S-box. Also in NodeJS☆91Updated 5 months ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- A small DFA for under 16 states☆52Updated 7 years ago
- Implementation of popular consensus protocols☆22Updated 5 years ago
- A learned index structure☆53Updated 4 years ago
- Non-preemptive Thread Hierarchy Manager☆55Updated 11 months ago
- Mmap radix sort file by a fixed length prefix of each line☆52Updated 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
- An Evaluation of Linear Probing Hashtable Algorithms☆32Updated last year
- Beating the `bisect` module's implementation using C-extensions.☆30Updated 2 years ago
- A SQLite extension for extracting values from serialized Protobuf messages☆88Updated 4 months ago
- ☆80Updated 4 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆157Updated last month
- HyperMinHash: Bringing intersections to HyperLogLog☆306Updated 7 years ago
- A simple single header 64 and 32 bit hash function using only add, sub, ror, and xor.☆78Updated 3 years ago
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- DISCoHAsH - Simple, fast, quality hash in 120 lines. 10GB/s serial (depending on hardware). Also in NodeJS☆218Updated 2 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
- Secure storage for cryptographic secrets, modeled after sudo☆78Updated 5 years ago
- Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"☆204Updated 5 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Poireau: a sampling allocation debugger☆98Updated 3 years ago
- A parser for SQLite create table sql statements.☆137Updated last year
- ☆58Updated 3 years ago
- C++11 library for fast fuzzy searching☆14Updated 10 years ago
- A totally proof-of-concept FoundationDB based network block device backend☆115Updated 7 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago