aboffa / CoCo-trieLinks
COllapsed and COmpressed trie: a data-aware compressed string dictionary
☆35Updated 7 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
- Learned Monotone Minimal Perfect Hashing☆27Updated 5 months ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- ☆38Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆48Updated 3 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- Succinct data structures in C/C++☆88Updated 11 months ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- ☆55Updated last year
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆87Updated 4 years ago
- Fast Approximate Membership Filters (C++)☆282Updated 3 weeks ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 5 months ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 3 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Dynamic succinct/compressed data structures☆111Updated last year
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- An adaptive radix tree for efficient indexing in main memory.☆164Updated last year
- ☆30Updated 6 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Updated 2 years ago
- ☆52Updated 9 months ago
- TSXor: A Simple Time Series Compression Algorithm☆53Updated 7 months ago
- Compact Tree Representation☆16Updated 8 years ago