Dev tools · alternatives · 2026
24 alternatives to Foyer, Hybrid in-memory and disk cache in Rust
Hybrid in-memory and disk cache in Rust. Contribute to foyer-rs/foyer development by creating an account on GitHub.
Foyer is a hybrid caching library written in Rust that stores data both in memory and on disk. Built for developers, it combines fast in-memory access with larger disk-based storage capacity. The tool addresses the… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes.
- 1

High-performance cache policies and supporting data structures for Rust systems, with optional metrics and benchmarks. - OxidizeLabs/cachekit
Jan 2026 · github.com · its alternatives →
- 2

Fast, secure, configurable. A bold new take on Nix caching.
2024 · determinate.systems · its alternatives →
- 3

- 4

Simple in-memory Key/Value Store written in Elixir using `cabol/ex_shards` - cabol/kvx
2016 · github.com · its alternatives →
- 5

A terminal-based text editor written in Rust. Contribute to gchp/iota development by creating an account on GitHub.
2014 · github.com · its alternatives →
- 6SA
2022 · shalerb.org · its alternatives →
- 7

Fast PUT/GET/DELETE in-memory key-value store for lookaside caching - jonhoo/cucache
2015 · github.com · its alternatives →
- 8

I built a SQLite VFS in Rust that serves cold queries directly from S3 with sub-second performance, and often much faster. It’s called turbolite. It is experimental, buggy, and may corrupt data. I would not trust it with anything important yet. I wanted to explore whether object storage has gotten fast enough to support embedded databases over cloud storage. Filesystems reward tiny random reads and in-place mutation. S3 rewards fewer requests, bigger transfers, immutable objects, and aggressively parallel operations where bandwidth is often the real constraint. This was explicitly inspired…
Mar 2026 · github.com · its alternatives →
- 9

I am the author of the platform, happy to reply to any question you might have! It scales up really nicely thanks to a year of research and development of the hashtable implemented in cachegrand, on the hardware used for benchmarking, an AMD EPYC 7502P, it was able to reach up to 5mln GET QPS and 4.5mln SET QPS, with batching up to 60mln GET QPS and up to 26MLN SET QPS. cachegrand is fast, it's fully Open Source, it's under a BSD 3-clause license - it can be used easily as standalone platform or incorporated in other ones without any licensing issue - and we are working to expand the Redis…
2022 · github.com · its alternatives →
- 10

Hey all, I recently published this Go package, and would like to show off as well as get feedback!
2024 · github.com · its alternatives →
- 11

I'm a software engineer who keeps getting pulled into DevOps no matter how hard I try to escape it. I recently moved into a Lead DevOps Engineer role writing tooling to automate a lot of the pain away. On my own time outside of work, I built Artifact Keeper — a self-hosted artifact registry that supports 45+ package formats. Security scanning, SSO, replication, WASM plugins — it's all in the MIT-licensed release. No enterprise tier. No feature gates. No surprise invoices. Your package managers — pip, npm, docker, cargo, helm, go, all of them — talk directly to it using their native…
Feb 2026 · github.com · its alternatives →
- 12

allocscope - a memory tracking tool. Contribute to matt-kimball/allocscope development by creating an account on GitHub.
2023 · github.com · its alternatives →
- 13

Linux filesystem defragger written in Rust and Qt Quick/Kirigami - gbin/defragger
Aug 2026 · github.com · its alternatives →
- 14DC
2016 · diskache.io · its alternatives →
- 15VN
repository: https://github.com/shimodateakira/VirtualStorageLibrary Hello HN, I'm excited to share a project I've been working on called VirtualStorageLibrary. It's a .NET library designed to manage in-memory tree structures, including items, directories, and symbolic links. VirtualStorageLibrary is a .NET library that operates entirely in-memory and provides a tree-structured collection. This library offers a foundation for managing hierarchical data structures, supporting items, directories, and symbolic links that encapsulate user-defined types (generic types defined…
2024 · shimodateakira.github.io · its alternatives →
- 16

Hi HN, I'm Kyle, the creator of Clipper, a container registry with 7x faster builds via lazy pulls and cache mount exports. In the process of implementing cache mount exports I ended up with a FUSE mounted filesystem backed by a remote content defined store. I went looking for fun things to do with it and found that there's not really a good way to keep Rust incremental build state around on ephemeral runners, so here we are. Rust generally uses https://github.com/mozilla/sccache for caching, but sccache disables itself when incremental compilation is enabled…
Jul 2026 · github.com · its alternatives →
- 17TA
2015 · bracewel.net · its alternatives →
- 18

I built a Ruby gem for memoization with TTL + LRU cache. It’s thread-safe, and has been helpful in my own apps. Would love to get some feedback: https://github.com/mishalzaman/memo_ttl
2025 · github.com · its alternatives →
- 19

Last night, while trying to figure out the best way to implement caching in my app, I had an idea for a dirt-simple caching system based on a dependency graph. The premise I started with is that one of the hardest things to manage in a cache is dependencies between entities. In order to cache items effectively, you inevitably have to duplicate "child" data inside of "parent" entries. Then, when a child is changed, you have to invalidate the child and its parents, and its parents' parents, and so on. To try to help this, I hacked together a simple Node.js library called Stash, which models…
2012 · github.com · its alternatives →
- 20

Cache management for Rails. Contribute to alvesjtiago/fastentry development by creating an account on GitHub.
2019 · github.com · its alternatives →
- 21

Have a look at my semantic caching project! It's built to easily integrate in existing LLM workflows, you can use it as a proxy where the cache forwards missed requests without modification to a specified upstream, automatically updating it's cache with the response. You can also use it as a cache-aside cache with a provided python library. It works by computing embedding vectors of input queries, and matches them to seen query + response pairs using a vector store. Everything is in-memory, so it should be blazing fast :)
2025 · github.com · its alternatives →
- 22AB
we've been working on a KV store for the past year or so which is 2-6x faster than Redis (benchmark link below) yet disk persisted! so you get the speed of in-memory KV stores but with disk persistence. To achieve this we've created our custom filesystem that is optimized for our special usecase and we're doing smart batching for writes and predictive fetching for reads. In addition to basic operations, it also provides atomic inc/dec, atomic json patch, range scans and a unique key monitoring mechanism (pub-sub) over WebSockets which essentially allows you to receive notification on…
2025 · hpkv.io · its alternatives →
- 23

Alternative to magic.h and infer. Zero dependencies. Fully extensible. Works in no_std, async, and embedded contexts.
2025 · crates.io · its alternatives →
- 24

A fast, multi-threaded Redis® and Valkey alternative written in Rust: drop-in compatible, with full-text and vector search built in - kividbio/kividb
2d ago · github.com · its alternatives →
Also compare
- Cachekit – High performance caching policies library in Rust alternatives
- FlakeHub Cache: Fast, secure, configurable. A new take on Nix caching alternatives
- UniCache by PLG Works alternatives
- Simple in-memory key/value store written in Elixir using Shards alternatives
- Iota – a text editor written in Rust alternatives
- Shale – a Ruby object mapper and serializer for JSON, YAML and XML alternatives
Ranked by how close each launch is in meaning, then by votes. Prices were read from each product’s own site when checked and can change. Refine with your own description →