aboffa / CoCo-trieLinks
COllapsed and COmpressed trie: a data-aware compressed string dictionary
☆35Updated 6 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:
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- ☆38Updated 5 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 5 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆46Updated 2 months ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated 11 months ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- ☆54Updated last year
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- Compact Tree Representation☆16Updated 8 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆87Updated 4 years ago
- Self-Tuning Adaptive Radix Tree☆28Updated 5 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Fast Approximate Membership Filters (C++)☆280Updated this week
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 3 weeks ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 4 months ago
- Tabular: Efficiently Building Efficient Indexes (VLDB 2025)☆21Updated 4 months ago
- Sequential implementation of the Rewired Memory Array.☆19Updated 6 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- ☆52Updated 9 months ago
- Succinct data structures in C/C++☆88Updated 10 months ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Updated 2 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 3 years ago
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 4 years ago