s-yata / madokaLinks
Count-Min sketch-based approximate counting library
☆46Updated 7 months ago
Alternatives and similar repositories for madoka
Users that are interested in madoka are comparing it to the libraries listed below
Sorting:
- A General-Purpose Counting Filter: Counting Quotient Filter☆130Updated 2 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆88Updated 4 years ago
- Succinct C++☆24Updated 5 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆65Updated last year
- A collection of succinct data structures☆211Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- a quotient filter written in C☆87Updated 8 years ago
- Compact Data Structures Library☆129Updated 11 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- Learned Monotone Minimal Perfect Hashing☆31Updated 8 months ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 4 years ago
- qp tries and crit-bit tries☆122Updated 3 years ago
- An efficient trie implementation.☆255Updated 5 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆120Updated 8 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Diskbased (persistent) hashtable☆165Updated last year
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 4 years ago
- LSM-trie☆114Updated 4 years ago
- Succinct Data Structure Library☆108Updated 12 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- C++ implementation of HyperLogLog☆61Updated last year
- High-performance dictionary coding☆108Updated 8 years ago
- The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.☆55Updated 4 years ago
- ☆27Updated 8 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated 9 months ago
- Moments Sketch Code☆40Updated 7 years ago