There are 3 repositories under succinct-data-structure topic.
🏅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
Rust libraries and programs focused on succinct data structures
Python bindings to Succinct Data Structure Library 2.0
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.
Dynatrace FM-Index library
:chart_with_downwards_trend: Disk Storage of Compressed k-mer Dictionaries, with or without Random Access in Main Memory.
Draft specification for bit popcount in JavaScript.
Implementation project of the paper titled: "Succinct Greedy Geometric Routing Using Hyperbolic Geometry"
Constant-Time Array Initialization
A compact inverted index based on a balanced wavelet tree implemented with bitvectors
OCaml implementations of succinct bitvector rank/select and wavelet trees, wrapping the bitv library
[DEPRECATED] Succinct Data Structures library for Rust
A brief literature review of efficient data structures for representing n-gram language models.
This project is a succinct implementation of the tree data structure using three different representations of the tree encoding. Then autthors have also implemented various tree navigational techniques.
Add-on for simongog/sdsl-lite that defines a new compressed bitvector called s9_vector
Project for the lecture Advanced Data Structures during summer term 2023
PoC - De Bruijn graph with PGMIndex
Succinct data structures for CMSC858D