0 views collected around this technical thread.
Redis achieves remarkable speed by storing data entirely in memory, employing a single‑threaded event loop with I/O multiplexing, and using highly optimized in‑memory data structures while balancing durability through efficient persistence mechanisms, all of which combine to minimize latency and maximize throughput.
This article explains how Redis achieves extremely high throughput—over 800 k QPS for simple commands and up to 1 M QPS with pipelining—through its C implementation, in‑memory data store, single‑threaded event loop, I/O multiplexing, and optional multithreaded I/O introduced in later versions.
The article explains that Redis achieves exceptional performance through four main factors—its in‑memory storage, optimized data structures, a single‑threaded architecture, and non‑blocking I/O—detailing how each contributes to speed and efficiency.
This article explains why Redis delivers high query speed by leveraging its in‑memory architecture, custom data structures such as SDS, linked lists, hash tables, skip‑lists, and intsets, a single‑threaded execution model combined with efficient I/O multiplexing, and recent multithreaded I/O enhancements.
Redis achieves high performance by storing all data in memory, using compact data structures such as SDS, ziplist and skiplist, running a single‑threaded event loop with lock‑free execution, and employing efficient I/O multiplexing and incremental rehash techniques to minimize latency and maximize throughput.
This article explains how Redis initializes, creates a TCP listener, registers file events, runs a single‑threaded reactor loop, accepts client connections, processes commands via a command table, and sends replies, illustrating the core backend architecture of the in‑memory database.
The article explains how Redis implements a high‑performance single‑threaded architecture by using a Reactor‑style file‑event handler (FEH) built on I/O multiplexing, detailing socket events, the I/O multiplexing program, dispatcher, handler mapping, and the overall client‑server communication flow.
This article examines Redis's single‑threaded architecture by walking through its source code, detailing the main function initialization steps, the event‑loop implementation, and how file and time events are processed, while also noting the promotional messages interspersed throughout.
This article explains why Redis achieves extremely high performance by leveraging pure in‑memory operations, a global O(1) hash table, efficient data structures such as SDS, ziplist, quicklist and skiplist, a single‑threaded event loop with non‑blocking I/O multiplexing, and adaptive encoding strategies.
This article explains why Redis is exceptionally fast by detailing its in‑memory design, global hash table with O(1) lookups, incremental rehashing, specialized data structures such as SDS, ziplist, quicklist, skiplist and intset, as well as its single‑threaded event loop and epoll‑based I/O multiplexing.
Redis achieves exceptionally high performance despite its single‑threaded request handling by leveraging pure in‑memory operations, I/O multiplexing, non‑CPU‑intensive tasks, and specific single‑threaded advantages, while also incorporating multithreaded optimizations such as lazy‑free mechanisms and protocol parsing in newer versions.