Earlier quoted context omitted.
Depends a lot on the actual access patterns of your data. Many recent web & mobile apps have a lot of screens where you just want to grab one blob of heterogenous data and format it with the UI toolkit of choice. Or if they do display multiple results, it's O(10) rather than O(1000) or O(1M). Chasing pointers is fine for use-cases like this, because you do it once and you have all the information you're looking for.…
Depends a lot on the actual access patterns of your data. Yup. Thing is: with RDBMSs you are in control of both the storage patterns and the access patterns of your data. That's where a large part of the performance benefit comes from. > 50% of features could get by with read-only datasets that supported only key/value lookup Did you implement a storage pattern that was ordered by key (or hash(key) if you used hashin…
Well, I didn't implement it, Jeff Dean did, but yes, that's what we used for a lot of features.
https://www.quora.com/What-is-an-SSTable-in-Googles-internal...
https://www.igvita.com/2012/02/06/sstable-and-log-structured...