Key-Value Databases

A key-value database stores data as pairs: a key you look up by, and a value stored under it. There are no columns, no fixed schema, and — in the base model — no way to query by anything other than the key. You give it a key, it gives you back the value. That narrowness is the point: strip out everything a relational engine has to do for arbitrary queries, and what's left can be extremely fast and easy to spread across many machines.

Why the model exists

The clearest statement of the idea comes from Amazon's Dynamo, the internal system Amazon built to keep its shopping cart working even when disks were failing or a data center went dark. Dynamo exposes exactly two operations: get(key) and put(key, context, object). Values are opaque binary blobs, typically under 1 MB, with no relational schema and no multi-item transactions — only lookup by primary key. Amazon accepted that narrowness deliberately: a shopping cart that rejects a customer's "add to cart" click during a network blip is a lost sale, so Dynamo favors write availability over strict consistency, resolving conflicting versions later instead of blocking writes now.