nowfound

Alternatives

Products that do what Starskey – Fast Persistent Key-Value Store (Inspired by LevelDB) does

Hey everyone! I hope you’re all doing well. I thought I'd share a new open source Go project I started. It’s called Starskey! I’ve been diligently studying database internals, data structures, and more for almost two years now, writing many different things. This open-source key-value store is built on top of a log-structured merge tree, inspired by WiscKey and LevelDB. It's fairly fast, durable and rather efficient. It's meant to provide you a persistent embedded storage option for binary key value pairs. Github https://github.com/starskey-io/starskey Web…

  1. 1BA
  2. 2SI
  3. 3

    Slim, key organiser that transforms your cluster of keys!

    2016

  4. 4

    A Modern GUI For S3

    2025

  5. 5RF
  6. 6IA
  7. 7RA
  8. 8AD
  9. 9KV

    2017 · keyvalue.xyz

  10. 10

    An application-oriented unified storage layer for Golang.

    2021

  11. 11BA

    Hey HN! I work on a database for my day-job and I realized I had never written one from scratch, so I wrote bugfruit! Once I was mostly satisfied with it, I looked up some benchmarks to compare my simple database to other brand name key-value stores. I was surprised to see that mine held up fairly well on the subset of benchmarks I replicated. So I used the Pavlo Database Naming System [0] to name it and open-sourced the code. I'd love to hear any feedback you might have on it! [0] https://www.cs.cmu.edu/~pavlo/blog/2020/03/on-naming-a-datab...

    2022 · github.com

  12. 12GA
  13. 13BA

    2021 · docs.beryl.dev

  14. 14KF
  15. 15AS
  16. 16AD

    Hey hackernews! I'd like to share a hobby and passion project I've been working on for almost a year now. It's an open-source storage engine (underlying component of a database(s)) similar to that of LevelDB/RocksDB but written entirely in C. The storage engine is called TidesDB. TidesDB is written entirely in C. It's designed as a fast, transactional key-value storage engine built on a log-structured merge-tree (LSM-tree) architecture. My journey with TidesDB began nearly 2 years ago whilst I was experimenting with various data structures and databases in Go. When I encountered the…

    2025 · github.com

  17. 17SF

    Hey hn! I hope you're all doing well. I’d like to share a new open-source database I’ve designed and written called SuperMassive. SuperMassive is a scalable, distributed, in-memory key-value database designed from the ground up to allow for high concurrency, fast writes, fault tolerance, and durability while remaining simple to use and efficiently scalable. The idea for SuperMassive comes from its name.. I wanted to build a key-value database that can scale infinitely, remain durable, be self-healing, consistent, and blazing fast. I also wanted to simplify sharding and replication compared…

    2025 · github.com

  18. 18VA
  19. 19GA

    Hello HN! These last few months I've been working on my first open source project: an embedded database written in pure-go. That took me some months, as I had to learn how to deal with such large packages. Until then, all packages I had made were quite small an did not require much. I usually did not have to worry about things like allocation optimization and instance pools until This project. It started when I wanted to make a port of a tool to a TUI environment. I'm actually used to working with TUIs in golang, so that was my language of choice. The tool I wanted to port is written in…

    Feb 2026

  20. 20AS
  21. 21KA
  22. 22AS
  23. 23TA

    Hey everyone, I am sharing my open-source storage engine project TidesDB. I'd love to hear your feedback and thoughts. Cheers.

    Dec 2025 · github.com

  24. 24IB

    Disclaimer it is a heavily AI assisted project. The goal was not to be the most performative but the kind that's easier to learn from. I wanted to share this in case there are people who had the same idea or wanted to see something like this.

    Jun 2026 · github.com

Ranked by how close each launch is in meaning, then by votes. Refine with a description →