A tiny one dimensional database, written in Rust.
-
Updated
Aug 16, 2026 - Rust
A tiny one dimensional database, written in Rust.
A CPU cache-line hash table with zero-cost eviction. 64-byte buckets, LFU+LRU hybrid, 16-shard concurrency, per-entry TTL. 6.5-12x faster than moka on 4-thread workloads.
An efficient hash table implementation in written Rust
comparing Robin Hood hashing with linear probing, focusing on probe tails, displacement, load factor, and throughput
An educational Rust implementation of the Swiss Table hash map algorithm, built to understand how modern hash tables work under the hood.
Some data structures implemented in rust
To associate your repository with the hash-table topic, visit your repo's landing page and select "manage topics."