Software

Rust

sucds

Collection of succinct data structures.

tongrams-rs

Fast language model in compressed space.

vaporetto

Fast and lightweight pointwise prediction based tokenizer.

daachorse

Fast implementation of the Aho-Corasick algorithm using the compact double-array data structure.

fcsd

Fast and compact string dictionary using Front-Coding.

mih-rs

Multi-index hashing for neighbor searches on binary codes in the Hamming space.

lzd-rs

LZ double-factor factorization.

C++

xcdat

Fast compressed trie dictionary library.

poplar-trie

Memory-efficient dynamic tries.

rcomp

Online RLBWT compression in optimal-time and BWT-runs bounded space.

dyft

Dynamic Filter Trie (DyFT).

bST

b-bit sketch trie for similarity search.

fast_succinct_trie

String map through Fast Succinct Trie (FST).

constexpr_doublearray

Constexpr double-array trie.

kdtw

C++11 implementation of KDTW and its Python binding.

frechet_simsearch

Experimental library of approximate trajectory similarity search under Fréchet distance.

consistent_weighted_sampling

Software of 0-bit Consistent Weighted Sampling.

succinctrits

Succinct Rank/Select Data Structures on Trits

dictionary_bench

Benchmark for dynamic keyword dictionaries.

cda-tries

Compressed double-array tries for static string dictionaries.

ddd

Experimental implementation of dynamic double-array dictionaries.

bonsais

Experimental trie implementation using Bonsai structures.

Others

LUBM-URIs

URI dataset generator from Lehigh University Benchmark

doublearray-go

Go implementation of double-array minimal-prefix trie

xchecker

トライ木からダブル配列を構築するゲーム