Understanding Redis: From Basic Concepts to Advanced Features and Deployment Strategies

Redis is an open‑source, BSD‑licensed in‑memory data store that can serve as a database, cache, and message broker, supporting strings, lists, hashes, sets, sorted sets, bitmaps, hyperloglogs, and geospatial indexes.

It includes built‑in replication, Lua scripting, LRU eviction, transactions, and high‑availability via Sentinel and automatic sharding with Redis Cluster.

1. Starting from Zero

An API delivering hot news suffered ~2 seconds latency per request; the first naive improvement added HTTP cache‑control headers (max‑age=600) to let clients cache responses for ten minutes, reducing perceived latency but introducing stale data and not solving server‑side delays.

The next step cached SQL query results in the API server’s memory for one minute, eliminating the 2‑second delay for most requests but quickly exhausting server memory.

2. In‑Memory Caching on the Server

To avoid memory pressure, the cached data was moved to a dedicated Redis server, freeing API server memory.

3. Redis on the Server Side

3.1 Persistence

Redis persistence writes in‑memory data to disk so that after a restart the cache can be restored, mitigating data loss and cache‑avalanche effects.

3.2 Sentinel and Replication

Sentinel monitors multiple Redis instances, provides alerts, and performs automatic failover, while replication creates standby copies of a master server, together ensuring high availability.

3.3 Cluster

Redis Cluster distributes data across multiple nodes using 16,384 hash slots; each node owns a subset of slots, and clients compute the slot for a key (CRC16(key) % 16384) to locate the responsible node, enabling horizontal scaling and seamless node addition or removal.

4. Redis on the Client Side

4.1 Data Types

Redis offers various data structures: string (binary‑safe up to 512 MB), list (ordered collection), set (unordered unique elements), sorted set (ordered by score), hash (field‑value map), bitmap (bit‑level operations), and hyperloglog (probabilistic cardinality).

4.2 Transactions

Transactions allow atomic execution of multiple commands in sequence.

4.3 Lua Scripting

Lua scripts run atomically on the server, enabling complex operations such as conditional cache expiration.

4.4 Pipelining

Pipelining batches multiple commands over a single TCP connection to reduce round‑trip overhead, though it does not guarantee atomicity.

4.5 Distributed Locks

Redis implements the Redlock algorithm using the SET command with NX and PX options, and releases locks via a Lua script that checks ownership before deleting the key.

SET resource_name my_random_value NX PX 30000
if redis.call("get", KEYS[1]) == ARGV[1] then
    return redis.call("del", KEYS[1])
else
    return 0
end

Conclusion

The article abstracts Redis’s functionalities—persistence, high availability, clustering, data structures, transactions, scripting, pipelining, and distributed locking—to clarify the problems each feature solves, helping practitioners choose appropriate Redis capabilities for specific scenarios.