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 6 months ago
- Backtrace.io's resilient log record framing format☆38Updated 3 years ago
- Wolfsort is a stable adaptive hybrid radix / merge sort.☆196Updated last year
- A learned index structure☆53Updated 4 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- HyperMinHash: Bringing intersections to HyperLogLog☆305Updated 7 years ago
- A SQLite extension for extracting values from serialized Protobuf messages☆87Updated last month
- UMASH: a fast enough hash and fingerprint with collision bounds☆157Updated 6 months ago
- A small DFA for under 16 states☆51Updated 7 years ago
- ☆80Updated 3 years ago
- Beamsplitter - A new (possibly universal) hash that passes SMHasher. Built mainly with a random 10x64 S-box. Also in NodeJS☆91Updated 3 months ago
- Non-preemptive Thread Hierarchy Manager☆55Updated 9 months ago
- An Evaluation of Linear Probing Hashtable Algorithms☆32Updated 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
- Mmap radix sort file by a fixed length prefix of each line☆52Updated 5 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Implementation of popular consensus protocols☆21Updated 4 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"☆204Updated 5 years ago
- C++11 library for fast fuzzy searching☆14Updated 10 years ago
- ☆27Updated 7 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- DISCoHAsH - Simple, fast, quality hash in 120 lines. 10GB/s serial (depending on hardware). Also in NodeJS☆218Updated 2 years ago
- Postgres Generic Clever Scanning Data Verify/Recovery Xpress☆18Updated 5 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Poireau: a sampling allocation debugger☆99Updated 3 years ago
- Automatically exported from code.google.com/p/smhasher☆16Updated 4 years ago
- Assorted notes☆84Updated last year
- Zig library for HyperLogLog estimation☆89Updated last year
- Shuffle-based predicate matcher and all-round branch free swiss army chainsaw☆17Updated 7 years ago