Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

I feel like the word "database" is throwing people off because they're comparing it with something like MySql/Postgres, when this seems slightly more complex than a k/v store stored to a file, with some other indexing, where data integrity is a low priority. That shouldn't take too much time and should be fairly isolated on the tech side so little involvement from product/project managers.


A k/v store typically is really fast at looking up the value based on the key. So there are usually some pretty advanced indexes involved.


or a simple b-tree...


My simple btrees have had bugs in them. :)

(Though to be fair, if I actually wanted to put this in prod it probably wouldn't take too long to fuzz it and fix the kinks.)

https://github.com/eatonphil/btree-rs


For a k/v store, a hash table will take you very, very far.


80/20




Consider applying for YC's Summer 2026 batch! Applications are open till May 4

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: