PATRICIA, Double Array, LOUDS Trie implementations for Java
-
Updated
Jul 16, 2024 - Java
#
louds
Here are 7 public repositories matching this topic...
Memory efficient trie (prefix tree) library based on LOUDS
-
Updated
Mar 14, 2025 - Rust
High performance LOUDS (Level-Order Unary Degree Sequence) library
-
Updated
Jul 19, 2024 - Rust
[DEPRECATED] Succinct Data Structures library for Rust
-
Updated
Aug 25, 2019 - Rust
High‑performance Go string store with regex search, LSM‑tree compaction, and WAL durability
search golang storage-engine high-performance regex concurrency bloom-filter regular-expression wal elias-fano rcu go-library pprof lsm-tree write-ahead-log louds trigram compaction blake3
-
Updated
Apr 10, 2026 - Go
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.
tree dictionary trie data-structures binary-tree dawg double-array key-value-store louds data-structures-and-algorithms double-array-trie
-
Updated
Nov 16, 2025 - C#
A brief literature review of efficient data structures for representing n-gram language models.
-
Updated
May 31, 2019 - TeX
Improve this page
Add a description, image, and links to the louds topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the louds topic, visit your repo's landing page and select "manage topics."