gvinciguerra / BlockEpsilonTree
🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
☆11Updated 2 years ago
Alternatives and similar repositories for BlockEpsilonTree:
Users that are interested in BlockEpsilonTree are comparing it to the libraries listed below
- A Space-Optimal Grammar Compression☆10Updated 4 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Compact Tree Representation☆16Updated 8 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 6 months ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆29Updated 4 months ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 6 years ago
- Clustered Elias-Fano inverted indexes.☆15Updated 6 years ago
- C++17 Implementation of Dynamic Filter Trie☆8Updated 3 years ago
- A blend of the compact and sparse hash table implementations.☆12Updated 3 years ago
- simd enabled column imprints☆11Updated 7 years ago
- Learned Monotone Minimal Perfect Hashing☆25Updated 3 months ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- Succinct C++☆24Updated 4 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Space efficient (graph) algorithms☆18Updated 4 years ago
- Implementation of QuadSketch algorithm☆11Updated 2 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- Hash table with separate chaining layout☆9Updated 3 years ago
- ☆25Updated 8 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆10Updated 2 years ago
- ☆12Updated 7 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 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☆52Updated last year