liveBook · Manning

Key-value store

A key-value store is a data-storage system that associates keys with values and supports storing, retrieving, or updating values by key.

How 8 Manning books explain it

Amazon Web Services in Action, Third Edition: An in-depth guide to AWS

A key-value store is a data store that associates unique keys with corresponding values rather than organizing data into relational tables.

How it is used
Uses key-value storage for a DynamoDB-backed to-do application and an in-memory game leaderboard.
How deep it goes
Defines keyed items, then develops application commands and retrieval choices; does not describe storage internals.
Examples
Uses a command-line to-do application with users and tasks, plus a Redis-backed game leaderboard.
What you can do after
Build it from scratch: implement a Node.js to-do application using the AWS SDK and plan how its items will be retrieved.

Read how Amazon Web Services in Action, Third Edition: An in-depth guide to AWS explains key-value store →

Functional Design and Architecture: Examples in Haskell

Key-value storage is a storage model that associates values with keys for retrieval and update.

How it is used
Supports persistence and simulation state through key-based saves and loads, then anchors a layered database subsystem.
How deep it goes
Develops raw ByteString operations into typed entity keys, values, conversions, associated types, and functional dependencies.
Examples
Uses meteor and comet entities for typed loading, RocksDB and Redis bindings, and an in-memory concurrent simulator map.
What you can do after
Build it from scratch as a raw key-value interface with an optional type-safe layer for entity-specific loading.

Read how Functional Design and Architecture: Examples in Haskell explains key-value store →

The Quick Python Book, Fourth Edition

A key-value store is a data-storage system that associates uniquely identified keys with values for retrieval and modification.

How it is used
Deploys Redis for caching, message brokering, quick lookups, counters, lists, and expiring values.
How deep it goes
Demonstrates Python operations for strings, counters, lists, indexing, and expiration without descending into Redis internals.
Examples
Uses Redis strings, counters, lists, indexed retrieval, client configuration, server startup, and timed expiration.
What you can do after
Operate Redis through Python by connecting to a server, storing values, querying keys, managing lists, and setting expiration.

Read how The Quick Python Book, Fourth Edition explains key-value store →

Elixir in Action, Third Edition

A key-value store is a data structure that associates each key with a corresponding value.

How it is used
Demonstrates process state, generic server abstractions, and shared-state performance trade-offs.
How deep it goes
Builds implementations with maps, callbacks, wrappers, benchmarks, and concurrency observations, but does not develop a production storage system.
Examples
Uses put/get interactions, GenServer code, one-million-key load tests, and concurrent-client benchmarks.
What you can do after
Build it from scratch as a process-backed store and evaluate when ETS may improve shared-access performance.

Read how Elixir in Action, Third Edition explains key-value store →

Build and Orchestrator in Go (From Scratch)

A key/value store is a datastore that associates unique keys with values for direct lookup.

How it is used
Provides fast, simple embedded storage for orchestrator data shared by managers and workers.
How deep it goes
Develops the key/value model from an in-memory map to persistent BoltDB, while stopping short of detailed storage internals.
Examples
Uses a Go map, UUID-keyed tasks, task and event stores, and BoltDB installation as concrete examples.
What you can do after
Operate/configure BoltDB as an embedded persistent store after modeling task data through simple key-based access.

Read how Build and Orchestrator in Go (From Scratch) explains key-value store →

Latency

A key-value store is a data-storage system that associates values with keys and supports operations such as retrieving and updating a value by its key.

How it is used
Supports direct reads and updates, especially for simple caching, session state, profiles, and settings.
How deep it goes
Builds an in-memory implementation and replicated primary–replica workflow, while deferring durable database design and complex queries.
Examples
Demonstrates Rust shells storing a, b, and c, synchronizing snapshots, and propagating later writes from primary to replica.
What you can do after
Build it from scratch as an in-memory store, then operate a primary–replica setup with snapshots and update broadcasts.

Read how Latency explains key-value store →

Learn Go with Pocket-Sized Projects

Key-value storage is a data-storage model that associates each key with a corresponding value for retrieval by key.

How it is used
Uses key-value storage for games indexed by ID and for reusable in-memory caches.
How deep it goes
Explains map representation, generic constraints, initialization, value ownership, and basic operations, stopping short of persistent storage.
Examples
Demonstrates games keyed by IDs, integer-to-string tests, and a generic Cache with Read, Upsert, and Delete methods.
What you can do after
Build a generic in-memory cache with comparable keys, initialized maps, and controlled read, update, and delete operations.

Read how Learn Go with Pocket-Sized Projects explains key-value store →

Rust in Action: Systems programming concepts and techniques

A key-value store is a data-storage system that associates keys with values and supports storing and retrieving those values.

How it is used
Builds a storage system that associates arbitrary byte sequences and retrieves them through direct key lookup.
How deep it goes
Descends from the key-value model through in-memory APIs to file-backed persistence, checksums, indexing, and hardware-failure durability.
Examples
Uses country-capital mappings, an in-memory command-line application, and a complete Rust file-backed implementation.
What you can do after
Build it from scratch as a Rust key-value store that stores, retrieves, indexes, and persists arbitrary byte sequences.

Read how Rust in Action: Systems programming concepts and techniques explains key-value store →

Related concepts

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.