Scope, and a single-server key-value store
Play this lessonThis lesson comes with a live-code challenge and a chapter quiz.Easy: keep pairs in a hash table in memory. Memory is limited, though, so two optimizations: compress data, and keep only frequently used data in memory with the rest on disk. Even so, one server runs out of capacity quickly. To support big data, we need a distributed store.
The rest of this lesson is part of Pro
Pro unlocks every lesson with its animation, code challenge and quiz, plus every interview problem. ₹299 a month or ₹1,999 a year.
See Pro