🏅State-of-the-art learned data structure that enables fast lookup, predecessor, range searches and updates in arrays of billions of items using orders of magnitude less space than traditional indexes

Sux4J is an effort to bring succinct data structures to Java.

Rust libraries and programs focused on succinct data structures

Memory efficient trie (prefix tree) library based on LOUDS

Succinct data structures in C/C++

High performance LOUDS (Level-Order Unary Degree Sequence) library

Python bindings to Succinct Data Structure Library 2.0

FM-index for Rust

High performance FID (Fully Indexable Dictionary) library

String map implementation through Fast Succinct Trie

🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.

The first range filter to simultaneously support dynamic operations, variable-length keys, range queries of any length, and high performance while providing a theoretical false positive rate guarantee.

Dynatrace FM-Index library

Grafite is a data structure that enables fast range emptiness queries using optimal space and time.

🚀 The first learned approach to the Range Minimum Query (RMQ) problem, providing robust theoretical guarantees and novel space-time trade-offs.

🛠 Succinct utilities to handle bits.

C++17 library that packed some of succinct data structures and algorithms supports.

Succinct Rank/Select Data Structures on Trits

FID (Fully Indexable Dictionary) implementation for Rust

A lightweight Rust library for BitVector Rank&Select operations, coupled with a generic Sparse Array implementation.

Draft specification for bit popcount in JavaScript.

LOUDS implementation for Rust

Fast Succinct Trie for Go. Support Marshalling

:chart_with_downwards_trend: Disk Storage of Compressed k-mer Dictionaries, with or without Random Access in Main Memory.

Implementation project of the paper titled: "Succinct Greedy Geometric Routing Using Hyperbolic Geometry"

OCaml implementations of succinct bitvector rank/select and wavelet trees, wrapping the bitv library

Constant-Time Array Initialization

A compact inverted index based on a balanced wavelet tree implemented with bitvectors

[DEPRECATED] Succinct Data Structures library for Rust

sparse dense array