gvinciguerra / BlockEpsilonTreeLinks
🌳 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
Sorting:
- 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
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Universe-sliced indexes in C++.☆18Updated 2 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
- Compact Tree Representation☆16Updated 8 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 8 months ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- ☆28Updated 2 years ago
- simd enabled column imprints☆11Updated 7 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆34Updated 3 months ago
- Hash table with separate chaining layout☆9Updated 3 years ago
- LZ Double factor Factorization.☆11Updated 8 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 2 months ago
- Succinct C++☆24Updated 4 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- C++17 Implementation of Dynamic Filter Trie☆8Updated 3 years ago
- ☆12Updated 7 years ago
- Space efficient (graph) algorithms☆18Updated 4 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- ☆26Updated 8 years ago
- A blend of the compact and sparse hash table implementations.☆14Updated 3 years ago
- ☆12Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago