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:
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Feb 15, 2025Updated last year
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Sep 12, 2022Updated 3 years ago
- Efficient Prefix-Sum data structures in C++.☆26Oct 1, 2023Updated 2 years ago
- Static Huffman coding☆10Apr 3, 2017Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- Compressed double-array tries for static string dictionaries☆11May 9, 2019Updated 6 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Feb 15, 2022Updated 4 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- String map implementation through Fast Succinct Trie☆23Jul 9, 2021Updated 4 years ago
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 3 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 8 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆34Apr 7, 2025Updated 10 months ago
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆36Nov 7, 2025Updated 3 months ago
- A C++ library to benchmark inverted indexes.☆21Aug 4, 2020Updated 5 years ago
- Fast compressed trie dictionary library☆71Sep 20, 2024Updated last year
- Implementation of a Backpack Quotient Filter☆13Jul 7, 2025Updated 7 months ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 7 months ago
- C++ Library implementing Compressed String Dictionaries☆46Apr 25, 2022Updated 3 years ago
- ☆13Jan 21, 2022Updated 4 years ago
- Learned Monotone Minimal Perfect Hashing☆31Apr 1, 2025Updated 10 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated 8 months ago
- A library of inverted index data structures☆151Dec 15, 2022Updated 3 years ago
- Cloud Native Distributed Nearest Neighbour Search☆15Jun 9, 2020Updated 5 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 years ago
- A blend of the compact and sparse hash table implementations.☆15Aug 20, 2021Updated 4 years ago
- Source code of our implementation of the concurrent RMA☆12May 23, 2019Updated 6 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- Efficient and effective query auto-completion in C++.☆57Sep 24, 2023Updated 2 years ago
- A new lossless data compression algorithm☆12Nov 19, 2025Updated 3 months ago
- A fast approximate membership query data structure☆12Jul 16, 2024Updated last year
- Essential C++ utilities.☆14Nov 13, 2025Updated 3 months ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Dec 20, 2022Updated 3 years ago
- 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
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14May 11, 2018Updated 7 years ago
- Succinct data structures in C/C++☆94Oct 7, 2024Updated last year
- A C++ library implementing fast language models estimation using the 1-Sort algorithm.☆17May 18, 2023Updated 2 years ago
- Succinct Data Structure Library 3.0☆103Dec 15, 2025Updated 2 months ago
- ☆37Nov 5, 2020Updated 5 years ago
- GPU based Compressed Graph Traversal☆16Jan 9, 2026Updated last month