2 ms·
Well answered by other comments here, the whole "eventually consistent blob" vs "directed graph of mutation operations" problem. FWIW, this is a good distribute
by ChuckMcM 11y ago
Well answered by other comments here, the whole "eventually consistent blob" vs "directed graph of mutation operations" problem. FWIW, this is a good distributed systems interview question :-)
- bm1362 11y agoYou can really do either with S3- it's just an eventually consistent, immutable kv. A) Keep a consistent manifest of chunk range to keys. B) Keep a ordered list of keys that represent the DAG. In case A, you'll be able to assemble your blob in parallel even.