🏅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
-
Updated
Apr 24, 2024 - C++
🏅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++
Python bindings to Succinct Data Structure Library 2.0
High performance LOUDS (Level-Order Unary Degree Sequence) library
High performance FID (Fully Indexable Dictionary) library
String map implementation through Fast Succinct Trie
Grafite is a data structure that enables fast range emptiness queries using optimal space and time.
🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
C++17 library that packed some of succinct data structures and algorithms supports.
A lightweight Rust library for BitVector Rank&Select operations, coupled with a generic Sparse Array implementation.
Succinct Rank/Select Data Structures on Trits
FID (Fully Indexable Dictionary) implementation for Rust
Draft specification for bit popcount in JavaScript.
📉 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"
Add a description, image, and links to the succinct-data-structure topic page so that developers can more easily learn about it.
To associate your repository with the succinct-data-structure topic, visit your repo's landing page and select "manage topics."