Succinct data structures in C/C++
☆98May 5, 2026Updated 6 months ago
Alternatives and similar repositories for sux
Users that are interested in sux are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Compact Tree Representation☆16Mar 16, 2017Updated 9 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 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
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 4 years ago
- Benchmark of four minimal perfect hash libraries (phf, emphf, CMPH, Sux4J)☆14Apr 6, 2017Updated 9 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- Sux4J is an effort to bring succinct data structures to Java.☆176Oct 12, 2026Updated last month
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated this week
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆47Sep 4, 2024Updated 2 years ago
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆14Dec 9, 2024Updated last year
- ☆28Sep 28, 2022Updated 4 years ago
- String map implementation through Fast Succinct Trie☆24Jul 9, 2021Updated 5 years ago
- MathLib is a versatile C++ library that provides a wide range of mathematical algorithms and functions, including but not limited to tran…☆10Jun 6, 2023Updated 3 years ago
- Dynamic succinct/compressed data structures☆120Dec 17, 2025Updated 11 months ago
- ☆20Apr 30, 2026Updated 6 months ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- Learned Monotone Minimal Perfect Hashing☆32Sep 13, 2026Updated 2 months ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated last year
- Bumped Ribbon Retrieval and Approximate Membership Query☆52Sep 13, 2026Updated 2 months ago
- ☆28Mar 23, 2017Updated 9 years ago
- Succinct Data Structure Library 2.0☆2,312Jun 2, 2023Updated 3 years ago
- Succinct C++☆24Sep 13, 2020Updated 6 years ago
- Dictionary-based compression for inverted indexes.☆23Mar 22, 2019Updated 7 years ago
- BitMagic Library☆459Updated this week
- An efficient minimal perfect hash function generator for small sets☆12Dec 12, 2020Updated 5 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force☆15Mar 31, 2025Updated last year
- Source code of our implementation of the concurrent RMA☆12May 23, 2019Updated 7 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 5 years ago
- Bloom-filter based minimal perfect hash function library☆281Jul 16, 2025Updated last year
- C++17 implementation of memory-efficient dynamic tries☆59Feb 15, 2022Updated 4 years ago
- ☆13Nov 24, 2019Updated 6 years ago
- LZ Double factor Factorization.☆11Feb 26, 2017Updated 9 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆11Sep 13, 2018Updated 8 years ago
- 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.
- ☆13Jul 15, 2025Updated last year
- Fastest Integer Compression☆851Oct 8, 2026Updated last month
- A library of inverted index data structures☆151Dec 15, 2022Updated 3 years ago
- Implementation of the sacabench framework☆20May 15, 2021Updated 5 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Jan 31, 2015Updated 11 years ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆27Apr 26, 2022Updated 4 years ago
- C Minimal Perfect Hashing Library☆91Mar 2, 2017Updated 9 years ago
Are these results useful?