kampersanda / dyft
C++17 Implementation of Dynamic Filter Trie
☆8Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for dyft
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- Compact Tree Representation☆16Updated 7 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 6 years ago
- A C++ template library for compact Hamming distance indexes☆10Updated 7 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- TU DOrtmund lossless COMPression framework☆17Updated 2 months ago
- C++ Library implementing Compressed String Dictionaries☆45Updated 2 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- LZ Double factor Factorization.☆11Updated 7 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆33Updated 11 months ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 3 years ago
- A Space-Optimal Grammar Compression☆10Updated 3 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- Essential C++ utilities.☆15Updated 4 months ago
- C++17 implementation of memory-efficient dynamic tries☆57Updated 2 years ago
- SUccinct Retrieval Framework☆19Updated 8 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- C++ Implementation of Zip Trees☆13Updated 2 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- ☆11Updated 6 years ago
- Hash table with separate chaining layout☆9Updated 3 years ago
- Learned Monotone Minimal Perfect Hashing☆23Updated 2 months ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- Bit packed vector of integral values☆26Updated last year
- Space efficient (graph) algorithms☆17Updated 4 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated last year
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆48Updated 5 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 2 months ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆26Updated 2 months ago