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☆23Updated 2 months ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- ☆37Updated 4 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 2 months ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆39Updated last month
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆27Updated 3 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆32Updated last year
- Clustered Elias-Fano inverted indexes.☆14Updated 6 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- C++ Library implementing Compressed String Dictionaries☆45Updated 2 years ago
- Compact Tree Representation☆16Updated 7 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆10Updated last year
- ☆51Updated 5 months ago
- Self-Tuning Adaptive Radix Tree☆27Updated 4 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆26Updated 2 months ago
- Succinct C++☆25Updated 4 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set union☆40Updated 4 years ago
- C++17 implementation of memory-efficient dynamic tries☆57Updated 2 years ago
- C++ Implementation of Zip Trees☆13Updated 2 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆37Updated 9 years ago
- Sequential implementation of the Rewired Memory Array.☆17Updated 5 years ago
- based on the work of Harald Lang when at CWI☆22Updated 4 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 11 years ago
- Template Vector Library☆18Updated 3 years ago
- ☆15Updated 3 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆28Updated last year