succinct-data-structure

🏅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

High performance FID (Fully Indexable Dictionary) library

FM-index for Rust

String map implementation through Fast Succinct Trie

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

Dynatrace FM-Index library

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

🚀 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.

Succinct Rank/Select Data Structures on Trits

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

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.

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

FID (Fully Indexable Dictionary) implementation for Rust