Succinct data structures in C/C++
☆94Oct 7, 2024Updated last year
Alternatives and similar repositories for sux
Users that are interested in sux are comparing it to the libraries listed below
Sorting:
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 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
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆14Dec 9, 2024Updated last year
- Sux4J is an effort to bring succinct data structures to Java.☆172Jun 22, 2025Updated 9 months ago
- Dynamic succinct/compressed data structures☆117Dec 17, 2025Updated 3 months ago
- A collection of succinct data structures☆213Jan 3, 2024Updated 2 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated 9 months ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated this week
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 7 months ago
- ☆27Mar 23, 2017Updated 8 years ago
- ☆28Sep 28, 2022Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- Succinct C++☆24Sep 13, 2020Updated 5 years ago
- Learned Monotone Minimal Perfect Hashing☆31Apr 1, 2025Updated 11 months ago
- String map implementation through Fast Succinct Trie☆23Jul 9, 2021Updated 4 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- Succinct Data Structures for Rust☆59Jun 8, 2025Updated 9 months ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- Source code of our implementation of the concurrent RMA☆12May 23, 2019Updated 6 years ago
- Succinct Data Structure Library 2.0☆2,299Jun 2, 2023Updated 2 years ago
- Service to scan licenses from source code☆12Aug 14, 2023Updated 2 years ago
- ☆13Nov 24, 2019Updated 6 years ago
- BitMagic Library☆443Aug 26, 2025Updated 6 months ago
- C Minimal Perfect Hashing Library☆89Mar 2, 2017Updated 9 years ago
- A library of inverted index data structures☆150Dec 15, 2022Updated 3 years ago
- Bloom-filter based minimal perfect hash function library☆276Jul 16, 2025Updated 8 months ago
- A library for parsing security advisories☆13Feb 5, 2026Updated last month
- Implementation of the sacabench framework☆19May 15, 2021Updated 4 years ago
- prime search engine☆15Mar 22, 2018Updated 8 years ago
- Efficient Prefix-Sum data structures in C++.☆27Oct 1, 2023Updated 2 years ago
- The inverted index exchange format as defined as part of the Open-Source IR Replicability Challenge (OSIRRC) initiative☆11Aug 6, 2025Updated 7 months ago
- Experimental search engine in C/C++17 - still in early development.☆27Sep 5, 2025Updated 6 months ago
- ☆13Nov 15, 2017Updated 8 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 …☆26Apr 26, 2022Updated 3 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66May 29, 2024Updated last year
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Sep 13, 2018Updated 7 years ago
- Efficient and effective query auto-completion in C++.☆56Sep 24, 2023Updated 2 years ago
- LOUDS-trie implementation example (C++)☆14Nov 27, 2019Updated 6 years ago