s-yata / madokaLinks
Count-Min sketch-based approximate counting library
☆47Updated 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☆131Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated 2 years ago
- Succinct C++☆24Updated 5 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆89Updated 5 years ago
- A collection of succinct data structures☆211Updated 2 years ago
- a quotient filter written in C☆88Updated 8 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆65Updated last year
- A library of inverted index data structures☆151Updated 3 years ago
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- LSM-trie☆114Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Updated 2 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 4 years ago
- Compact Data Structures Library☆129Updated 11 years ago
- Moments Sketch Code☆40Updated 7 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 4 years ago
- Automatically exported from code.google.com/p/tx-trie☆29Updated 10 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- Succinct Data Structure Library☆109Updated 12 years ago
- Order-preserving key encoder☆127Updated 5 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- qp tries and crit-bit tries☆122Updated 3 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆11Updated 9 years ago
- Diskbased (persistent) hashtable☆166Updated last year
- Learned Monotone Minimal Perfect Hashing☆31Updated 9 months ago
- A locality-sensitive hashing library☆46Updated 11 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆32Updated 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
- Bloom-filter based minimal perfect hash function library☆270Updated 5 months ago
- A fast implementation for varbyte 32bit/64bit integer compression☆121Updated 8 years ago