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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆50Sep 12, 2022Updated 4 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Aug 9, 2023Updated 3 years ago
- Static Huffman coding☆10Apr 3, 2017Updated 9 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
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Efficient Prefix-Sum data structures in C++.☆28Oct 1, 2023Updated 3 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 9 years ago
- String map implementation through Fast Succinct Trie☆24Jul 9, 2021Updated 5 years ago
- C++17 implementation of memory-efficient dynamic tries☆59Feb 15, 2022Updated 4 years ago
- C++ Library implementing Compressed String Dictionaries☆47Apr 25, 2022Updated 4 years ago
- Universe-sliced indexes in C++.☆19Jan 8, 2023Updated 3 years ago
- Compressed double-array tries for static string dictionaries☆12May 9, 2019Updated 7 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆37Apr 7, 2025Updated last year
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated 2 years ago
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- A C++ library to benchmark inverted indexes.☆25Aug 4, 2020Updated 6 years ago
- Succinct data structures in C/C++☆98May 5, 2026Updated 6 months ago
- ☆11Oct 30, 2026Updated 2 weeks ago
- Succinct Data Structure Library 3.0☆112Updated this week
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated last year
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 5 years ago
- Wavelet tree based on a fixed block boosting technique☆17May 18, 2021Updated 5 years ago
- Bloom-filter based minimal perfect hash function library☆281Jul 16, 2025Updated last year
- Fast compressed trie dictionary library☆73Sep 20, 2024Updated 2 years ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆40Dec 20, 2022Updated 3 years ago
- Cloud Native Distributed Nearest Neighbour Search☆15Jun 9, 2020Updated 6 years ago
- A blend of the compact and sparse hash table implementations.☆15Aug 20, 2021Updated 5 years ago
- Succinct C++☆24Sep 13, 2020Updated 6 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Sep 30, 2025Updated last year
- A fast approximate membership query data structure☆12Jul 16, 2024Updated 2 years ago
- Dumps of CRoaring unity builds (for convenience)☆23Jul 20, 2022Updated 4 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 7 years ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- Dictionary-based compression for inverted indexes.☆23Mar 22, 2019Updated 7 years ago
- A Rust implementation of the Quad Wavelet Tree☆58Jul 8, 2026Updated 4 months ago
- Minimum plain text representation of kmer sets☆20Jan 30, 2025Updated last year
- KmerCamel🐫 provides implementations of several algorithms for efficiently representing a set of k-mers as a masked superstring.☆20Oct 1, 2026Updated last month
- ⚙️🛠️ Essential C++ utilities.☆15Oct 27, 2026Updated 3 weeks ago
- LOUDS-trie implementation example (C++)☆15Nov 27, 2019Updated 6 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆52Sep 13, 2026Updated 2 months ago
Are these results useful?