aboffa / CoCo-trieLinks
COllapsed and COmpressed trie: a data-aware compressed string dictionary
☆34Updated 3 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 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 9 months ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆44Updated 3 weeks ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Succinct C++☆24Updated 4 years ago
- ☆53Updated last year
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated last month
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- ☆12Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Efficient Prefix-Sum data structures in C++.☆26Updated last year
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- ☆51Updated 6 months ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- ☆20Updated 2 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Cache-Sensitive Skip List.☆22Updated 7 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆10Updated 2 years ago