simongog/sdsl-lite

Health v2 · maintenance only

Flags: no_license

Adoption not part of the score

2310 stars · 362 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded

A C++11 library implementing succinct data structures such as bitvectors with rank/select, wavelet trees, compressed suffix arrays, and compressed suffix trees. It stores data near the information-theoretic lower bound while supporting efficient query operations, with serialization and memory analysis tooling.

Use cases

• build compressed full-text indexes over large text collections
• store bitvectors supporting fast rank and select queries in minimal space
• implement wavelet trees for range queries on integer sequences
• construct compressed suffix arrays and suffix trees for string search
• serialize large succinct indexes to disk and reload them efficiently
• analyze memory usage of compact data structures

When to choose

• you need space-efficient data structures close to the information-theoretic lower bound
• you are building text indexing or bioinformatics tools in C++
• you want research-grade implementations of succinct structures from published literature
• you need to handle datasets larger than available RAM via compact representations

When to avoid

• you need simple general-purpose containers rather than specialized compact structures
• your project is not C++ or requires a permissive license (license is non-standard)
• you need actively developed features or quick bug-fix turnaround
• you want high-level APIs without understanding bit-level data structure internals

Facets

library · maturity maintenance

serialization search-engine developer-tools data-science developer-tools cpp windows cross-platform succinct-data-structures compressed-suffix-arrays wavelet-trees rank-select bitvectors suffix-trees c++11 algorithms search linux macos

Member repositories

For agents

markdown · JSON · MCP: product_card(name="simongog/sdsl-lite")