A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
☆36Jan 8, 2023Updated 3 years ago
Alternatives and similar repositories for mutable_rank_select
Users that are interested in mutable_rank_select are comparing it to the libraries listed below
Sorting:
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Aug 9, 2023Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated this week
- Static Huffman coding☆10Apr 3, 2017Updated 8 years ago
- Efficient Prefix-Sum data structures in C++.☆27Oct 1, 2023Updated 2 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 9 years ago
- String map implementation through Fast Succinct Trie☆23Jul 9, 2021Updated 4 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Feb 15, 2022Updated 4 years ago
- Compressed double-array tries for static string dictionaries☆11May 9, 2019Updated 6 years ago
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 3 years ago
- Cloud Native Distributed Nearest Neighbour Search☆15Jun 9, 2020Updated 5 years ago
- C++ Library implementing Compressed String Dictionaries☆47Apr 25, 2022Updated 3 years ago
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆38Mar 9, 2026Updated last week
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 8 months ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- A C++ library implementing fast language models estimation using the 1-Sort algorithm.☆16May 18, 2023Updated 2 years ago
- Fast compressed trie dictionary library☆72Sep 20, 2024Updated last year
- Succinct Data Structure Library 3.0☆104Dec 15, 2025Updated 3 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- ⚙️🛠️ Essential C++ utilities.☆14Mar 9, 2026Updated last week
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆34Apr 7, 2025Updated 11 months ago
- A fast approximate membership query data structure☆12Jul 16, 2024Updated last year
- Succinct data structures in C/C++☆94Oct 7, 2024Updated last year
- Official repository of the ACM SIGIR 2019 paper: "Fast Approximate Filtering of Search Results Sorted by Attribute" by Franco Maria Nardi…☆14Nov 7, 2019Updated 6 years ago
- Learned Monotone Minimal Perfect Hashing☆31Apr 1, 2025Updated 11 months ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated 9 months ago
- A collection of succinct data structures☆213Jan 3, 2024Updated 2 years ago
- LOUDS-trie implementation example (C++)☆14Nov 27, 2019Updated 6 years ago
- A library of inverted index data structures☆151Dec 15, 2022Updated 3 years ago
- Bloom-filter based minimal perfect hash function library☆276Jul 16, 2025Updated 8 months ago
- JIT Compilation for Multiple Architectures: C++, OpenMP, CUDA, HIP, OpenCL, Metal☆13Aug 6, 2025Updated 7 months ago
- A C++ library providing fast language model queries in compressed space.☆132Feb 25, 2023Updated 3 years ago
- A cheatsheet for most common Stringology tasks☆14Apr 14, 2021Updated 4 years ago
- Implementation of a Backpack Quotient Filter☆13Jul 7, 2025Updated 8 months ago
- A new lossless data compression algorithm☆12Nov 19, 2025Updated 4 months ago
- Fast Approximate Membership Filters (C++)☆24Apr 27, 2021Updated 4 years ago
- Circular span☆12May 24, 2024Updated last year
- An unsupervised text summarization and information retrieval library under the hood using natural language processing models☆15Dec 11, 2020Updated 5 years ago