gvinciguerra / BlockEpsilonTree
🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
☆11Updated 2 years ago
Related projects: ⓘ
- A Space-Optimal Grammar Compression☆10Updated 3 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- C++ Implementation of Zip Trees☆13Updated last year
- A blend of the compact and sparse hash table implementations.☆12Updated 3 years ago
- Compact Tree Representation☆16Updated 7 years ago
- Universe-sliced indexes in C++.☆17Updated last year
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆25Updated 2 weeks ago
- Succinct C++☆24Updated 4 years ago
- Learned Monotone Minimal Perfect Hashing☆20Updated 2 weeks ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆40Updated 2 weeks ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆46Updated 2 years ago
- C++17 implementation of memory-efficient dynamic tries☆57Updated 2 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆24Updated 4 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆31Updated 9 months ago
- Hash table with separate chaining layout☆9Updated 2 years ago
- C++17 Implementation of Dynamic Filter Trie☆9Updated 2 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 6 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆28Updated last year
- Clustered Elias-Fano inverted indexes.☆14Updated 6 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated last year
- testbed for different SIMD implementations for set intersection and set union☆38Updated 4 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆36Updated last week
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆26Updated 3 years ago
- ☆24Updated 7 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆10Updated last year
- simd enabled column imprints☆11Updated 6 years ago
- C++ Library implementing Compressed String Dictionaries☆45Updated 2 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆48Updated 7 months ago
- An encoder/decoder collection for a sequence of integers☆31Updated 11 years ago