3 ms·
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.
by hmottestad 3y ago
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.
- arandomusername 3y agoor a simple b-tree...
- eatonphil 3y agoMy 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 https://github.com/eatonphil/btree-rs
- paulddraper 3y ago80/20
- ozr 3y agoFor a k/v store, a hash table will take you very, very far.