aboffa / CoCo-trieLinks
COllapsed and COmpressed trie: a data-aware compressed string dictionary
☆35Updated 4 months ago
Alternatives and similar repositories for CoCo-trie
Users that are interested in CoCo-trie are comparing it to the libraries listed below
Sorting:
- Learned Monotone Minimal Perfect Hashing☆27Updated 2 months ago
- ☆38Updated 5 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 9 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☆45Updated last week
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- ☆54Updated last year
- ☆12Updated 4 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 2 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated 2 months ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆13Updated 6 months ago
- Compact Tree Representation☆16Updated 8 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆13Updated 2 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- Query engine synthesizer based on, our domain-specific language, VOILA☆13Updated 4 years ago
- based on the work of Harald Lang when at CWI☆23Updated 5 years ago
- Adaptive Radix Tree in C++☆45Updated 2 weeks ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- A read-optimized learned index for unsorted data☆31Updated last year
- Template Vector Library☆18Updated 4 years ago
- Sequential implementation of the Rewired Memory Array.☆19Updated 6 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago