PATRICIA, Double Array, LOUDS Trie implementations for Java
-
Updated
Jul 16, 2024 - Java
PATRICIA, Double Array, LOUDS Trie implementations for Java
Memory efficient trie (prefix tree) library based on LOUDS
High performance LOUDS (Level-Order Unary Degree Sequence) library
High‑performance Go string store with regex search, LSM‑tree compaction, and WAL durability
[DEPRECATED] Succinct Data Structures library for Rust
A .NET library providing a collection of high-performance, memory-efficient data structures, primarily focused on various trie implementations and advanced search capabilities. LOUDS, Double Array Trie, and more.
A brief literature review of efficient data structures for representing n-gram language models.
To associate your repository with the louds topic, visit your repo's landing page and select "manage topics."