Alternatives
Products that do what MemCloud does
Distributed in-memory data store
- 1

- 2

- 3

- 4

- 5

- 6

Linux filesystem defragger written in Rust and Qt Quick/Kirigami - gbin/defragger
13d ago · github.com
- 7

- 8AP
2024 · github.com
- 9AB
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
- 10MD
Hi HN, I'm Emilie, I have a literature background (which explains the well-written documentation!) and I've been learning Rust and distributed systems by building minikv over the past few months. It recently got featured in Programmez! magazine: https://www.programmez.com/actualites/minikv-un-key-value-st... minikv is an open-source, distributed storage engine built for learning, experimentation, and self-hosted setups. It combines a strongly-consistent key-value database (Raft), S3-compatible object storage, and basic multi-tenancy. Features/highlights: - Raft…
Feb 2026 · github.com
- 11

- 12RA
2019 · github.com
- 13RB
2024 · github.com
- 14

- 15

- 16MJ
2022 · github.com
- 17HM
I'm excited to share Hashmap.me, a small tool I've built to simplify data storage and retrieval. It's a straightforward service that allows developers to store data records via HTTP requests and retrieve them easily, all without the hassle of setting up and managing a database. Initially I built this because I was tired of creating a database to prototype my own projects, I just wanted to persist my in memory cache between restarts early on. Each hashmap you create corresponds to its own collection in MongoDB. Perfect for small projects, quick prototypes, or learning purposes. I'd love to…
2024 · hashmap.me
- 18MD
Hi HN, I’m releasing minikv, a distributed key-value and object store in Rust. What is minikv? minikv is an open-source, distributed storage engine built for learning, experimentation, and self-hosted setups. It combines a strongly-consistent key-value database (Raft), S3-compatible object storage, and basic multi-tenancy. I started minikv as a learning project about distributed systems, and it grew into something production-ready and fun to extend. Features/highlights: - Raft consensus with automatic failover and sharding - S3-compatible HTTP API (plus REST/gRPC APIs) - Pluggable…
Jan 2026 · github.com
- 19
- 20MM
This project contains no code from Linux, BSD, Minix, or any other OS. Everything up until this point is written entirely from scratch, including a pure microkernel (that only implements multiprocessor priority scheduling, memory management, and interprocess communication), a work-in-progress implementation of the standard C library, and a variety of servers that provide drivers and other essential OS functionality. At the time of writing this post, the servers provide drivers for the keyboard, NVMe SSDs (that works on real hardware), a Unix-like virtual file system (with a single root…
2024 · github.com
- 21GA
I built GRSH because I wanted a modern, memory-safe shell that feels native to FreeBSD but works seamlessly on macOS. While there are many shells out there, GRSH is my take on a minimal, fast, and secure command interpreter written entirely in Rust. It's designed for users who want the safety guarantees of Rust without the overhead of more bloated alternatives. I'm currently working on the official FreeBSD port. I’d love to get feedback on the shell's behavior and performance from the community. Github: https://github.com/antoniomalara301289/grsh
Jan 2026 · grimreaper.icu
- 22

- 23DM
2016 · github.com
- 24CM
2021 · github.com
Ranked by how close each launch is in meaning, then by votes. Refine with a description →