aboffa / CoCo-trie
COllapsed and COmpressed trie: a data-aware compressed string dictionary
☆33Updated 11 months ago
Related projects ⓘ
Alternatives and complementary repositories for CoCo-trie
- Learned Monotone Minimal Perfect Hashing☆24Updated this week
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- ☆37Updated 4 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆32Updated last year
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 2 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆39Updated this week
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆26Updated last week
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆27Updated 3 years ago
- ☆52Updated 6 months ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆10Updated last year
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 2 years ago
- C++ Implementation of Zip Trees☆13Updated 2 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆86Updated 3 years ago
- Compact Tree Representation☆16Updated 7 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆31Updated last year
- Succinct data structures in C/C++☆82Updated last month
- testbed for different SIMD implementations for set intersection and set union☆40Updated 4 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆51Updated 7 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 4 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆28Updated last year
- Succinct C++☆25Updated 4 years ago
- C++17 implementation of memory-efficient dynamic tries☆57Updated 2 years ago
- Sequential implementation of the Rewired Memory Array.☆18Updated 5 years ago
- C library to compute the Hamming weight of arrays☆44Updated 5 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 11 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago