A collection of succinct data structures
☆213Jan 3, 2024Updated 2 years ago
Alternatives and similar repositories for succinct
Users that are interested in succinct are comparing it to the libraries listed below
Sorting:
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Jan 27, 2023Updated 3 years ago
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆58Dec 7, 2012Updated 13 years ago
- A library of inverted index data structures☆151Dec 15, 2022Updated 3 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66May 29, 2024Updated last year
- Compact Data Structures Library☆128Sep 4, 2014Updated 11 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- Dynamic succinct/compressed data structures☆116Dec 17, 2025Updated 2 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Jan 31, 2015Updated 11 years ago
- Relative data structures based on the BWT☆12Apr 28, 2018Updated 7 years ago
- Succinct Data Structure Library 2.0☆2,296Jun 2, 2023Updated 2 years ago
- playground for working with succinct data structures☆97Oct 24, 2015Updated 10 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Apr 25, 2022Updated 3 years ago
- Compact Data Structures Library☆102Jun 20, 2022Updated 3 years ago
- Clustered Elias-Fano inverted indexes.☆15Jun 4, 2018Updated 7 years ago
- Succinct Data Structure Library 3.0☆103Dec 15, 2025Updated 2 months ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Apr 25, 2022Updated 3 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 7 months ago
- A tool for merging large BWTs☆24Nov 26, 2020Updated 5 years ago
- Succinct data structures in C/C++☆94Oct 7, 2024Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 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
- Succinct C++☆24Sep 13, 2020Updated 5 years ago
- A lightweight suffix-sorting library☆401Mar 25, 2020Updated 5 years ago
- Succinct Data Structure Library☆109Sep 26, 2013Updated 12 years ago
- Bit packed vector of integral values☆29Jan 28, 2025Updated last year
- A C++ library providing fast language model queries in compressed space.☆132Feb 25, 2023Updated 3 years ago
- ☆18Jul 24, 2025Updated 7 months ago
- C++11 library for fast fuzzy searching☆15Jun 9, 2015Updated 10 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 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
- Efficient construction of the BWT using string compression☆21Jun 3, 2025Updated 8 months ago
- Bloom filter alternative (C++)☆18Nov 8, 2018Updated 7 years ago
- An efficient trie implementation.☆255Nov 25, 2020Updated 5 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
- Morally-correct string and stream interpolation for Go.☆24Apr 23, 2016Updated 9 years ago
- BWT-based index for graphs☆73Mar 12, 2025Updated 11 months ago
- EXPERIMENTAL implementation of side graph☆10Apr 16, 2015Updated 10 years ago
- A hash map using the BooPHF perfect hash function☆13Sep 25, 2016Updated 9 years ago