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 last year
- Backtrace.io's resilient log record framing format☆40Updated 3 years ago
- A SQLite extension for extracting values from serialized Protobuf messages☆91Updated 7 months ago
- Wolfsort is a stable adaptive hybrid radix / merge sort.☆197Updated last year
- Fleur implements a Bloom Filter library in C that is fully compatible with DCSO's Go and python implementations.☆117Updated 2 years ago
- Non-preemptive Thread Hierarchy Manager☆56Updated last year
- An Evaluation of Linear Probing Hashtable Algorithms☆39Updated 2 years ago
- Mmap radix sort file by a fixed length prefix of each line☆52Updated 5 years ago
- A small DFA for under 16 states☆54Updated 7 years ago
- Implementation of popular consensus protocols☆22Updated 5 years ago
- A learned index structure☆53Updated 5 years ago
- Beamsplitter - A new (possibly universal) hash that passes SMHasher. Built mainly with a random 10x64 S-box. Also in NodeJS☆91Updated 9 months ago
- Fast Hash Functions Using AES Intrinsics☆85Updated 6 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- C++11 library for fast fuzzy searching☆14Updated 10 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆159Updated 2 weeks ago
- ☆81Updated 4 years ago
- Beating the `bisect` module's implementation using C-extensions.☆32Updated 2 years ago
- Assorted notes☆84Updated 2 years ago
- Postgres Generic Clever Scanning Data Verify/Recovery Xpress☆18Updated 6 years ago
- ☆37Updated 7 years ago
- DISCoHAsH - Simple, fast, quality hash in 120 lines. 10GB/s serial (depending on hardware). Also in NodeJS☆219Updated 2 years ago
- Secure storage for cryptographic secrets, modeled after sudo☆78Updated 5 years ago
- Poireau: a sampling allocation debugger☆98Updated 3 years ago
- HyperMinHash: Bringing intersections to HyperLogLog☆308Updated 7 years ago
- A simple and convenient binary date & time format in 64 bits.☆26Updated 6 years ago
- Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"☆205Updated 6 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆121Updated 8 years ago
- Shuffle-based predicate matcher and all-round branch free swiss army chainsaw☆17Updated 7 years ago
- Fast Approximate Membership Filters (C++)☆24Updated 4 years ago