s-yata / madokaLinks
Count-Min sketch-based approximate counting library
☆45Updated 3 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☆128Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆87Updated 4 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- a quotient filter written in C☆86Updated 7 years ago
- A collection of succinct data structures☆207Updated last year
- Succinct C++☆24Updated 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
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- qp tries and crit-bit tries☆121Updated 3 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 4 months ago
- High-performance dictionary coding☆104Updated 8 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- SUccinct Retrieval Framework☆21Updated 9 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Succinct Data Structure Library☆107Updated 11 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- A library of inverted index data structures☆150Updated 2 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- Compact Data Structures Library☆128Updated 10 years ago
- Count-Min Sketch Implementation in C☆47Updated last year
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- An efficient trie implementation.☆255Updated 4 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 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 library to compute the Hamming weight of arrays☆48Updated 6 years ago
- Moments Sketch Code☆40Updated 6 years ago
- LSM-trie☆114Updated 4 years ago
- Automatically exported from code.google.com/p/tx-trie☆29Updated 10 years ago