Re:Design Review: Key-Value Storage
by lclarkmichalek on Thursday November 08, 2018 @05:50PM
(#18410795)
I'm really surprised LSM trees didn't get more commentary. 'All are targeted at server workloads' - sure, but they're also incredibly popular and appear to be as close to the 'one-size-fits-all solution for storage' as we've found.
[ Parent
| on HN ]
Also typically more complicated and require a separate compaction process. They're good for writing lots of data, but not so great for random reads.
Author of Badger here. Our design of separating keys and values has gotten us incredibly fast writes, while still keeping the read latencies neck-to-neck against B+ trees. Worth checking out: https://github.com/dgraph-io/badger
Badger looks nicely done! Did you end up needing to change much in implementing Badger from what was described in the WiscKey paper?
Badger is really good, i'm using it.
This looks very interesting. Do you have any builtin compression or tips on compressing data?
Re:Design Review: Key-Value Storage
by guachesuedehack on Friday November 09, 2018 @05:15PM
(#18418509)
Nice, why the choice of go ?
[dead]
Please don't be a jerk in comments here.
Edit: sadly, it looks like you've been posting quite a few uncivil comments to HN. We ban accounts that do that, so would you please review https://news.ycombinator.com/newsguidelines.html and follow the rules from now on?
The idea here is: if you have a substantive point to make, make it respectfully and thoughtfully; if you don't, please don't comment until you do.