0 views collected around this technical thread.
This article addresses a high-concurrency inventory problem in a second-hand market's second-hand market system, focusing on solving the system's inventory deduction issue during flash sales using cache and asynchronous processing to achieve horizontal scalability.
iQIYI integrates Alluxio with its QBFS multi‑AZ unified scheduling system, automatically caching hot tables, applying table‑level policies, page‑level storage and AZ‑aware worker selection, which together cut cross‑zone traffic, halve query latency, achieve up to 20× I/O speedup and a three‑fold overall performance boost.
This article explains what constitutes a large Redis key, the performance problems it can cause such as CPU spikes, client timeouts and memory imbalance, and presents practical solutions including key cleanup, splitting, compression, pipeline usage, and alternative storage options.
This article explains how to use Redis' Sorted Set and Hash structures to achieve efficient pagination, multi‑condition fuzzy queries, and their combination, while also discussing performance optimizations such as expiration handling and data synchronization strategies.
This article walks through a real‑world R2M (Redis‑like) cache alert, detailing the email notification, large‑key analysis, code inspection, root‑cause identification, and both immediate and long‑term solutions that reduced cache usage by over 97% and prevented future incidents.
Vivo tackled high CPU overhead in large‑scale Dubbo deployments by disabling unused routers, caching routing results with BitMap intersections and epoch validation, optimizing weight calculations, and adding a grouping router, which together delivered over 100 % TPS gains for 20 k+ providers and cut CPU usage by roughly 27 %.
This article explains how Bloom filters, their counting variant, and Cuckoo filters work to reduce unnecessary database I/O by using bitmap or fingerprint techniques, discusses their false‑positive and deletion limitations, and presents practical optimizations for high‑performance hash‑based filtering.
To protect the outbox Redis cluster from extreme read amplification during hot events, the service adds a resident local cache for hot creators’ latest posts, using a threshold‑based list, change‑broadcast updates, and checksum verification, which achieved over 55% cache hits and cut peak Redis load by roughly 44% and CPU usage by 37%.
The presented hotspot detection and local‑cache framework leverages the HeavyKeeper streaming top‑k algorithm with decay‑based burst detection, integrates zero‑code SDK support and a whitelist‑enabled LRU cache, enabling a few megabytes of memory to achieve up to 85% hit rates and dramatically reduce Redis load in high‑traffic applications.
This article explains the concepts, advantages, and limitations of Bloom filters, Counting Bloom filters, and Cuckoo filters, illustrating how they reduce unnecessary I/O in backend systems and offering practical improvements such as multi‑hash functions and bucket designs to enhance space and time efficiency.
This article explains the motivation behind using probabilistic filters to reduce I/O, describes how Bloom filters, Counting Bloom filters, and Cuckoo filters work, analyzes their false‑positive and deletion problems, and presents practical optimizations such as multiple hash functions and multi‑slot buckets.
The article explains how Bloom filters, Counting Bloom filters, and Cuckoo filters work, their hash‑based bitmap mechanisms, advantages and limitations such as false positives and deletion issues, and presents practical improvements and hash functions for efficient cache and database query optimization.
The article explains the principles, advantages, and limitations of Bloom filters, introduces Counting Bloom filters as an enhanced version, and then details Cuckoo filters and Cuckoo hashing, including their algorithms, performance trade‑offs, and practical improvements for reducing unnecessary I/O operations.
This article details the JD Daojia coupon system's high‑traffic architecture, describing its multi‑layer design, Redis cache challenges such as large‑key and hot‑key issues, and practical optimization techniques including key redesign, expiration strategies, and active‑expire algorithms to improve performance and scalability.
The article explains Bloom filters—a probabilistic, space‑efficient data structure using multiple hash functions on a bit array to answer set‑membership queries with controllable false‑positive rates, detailing their construction, query process, optimal parameters, and common uses such as URL deduplication, cache protection, and spam filtering.
This article explains how to use Redis's SCAN command to iterate over dictionary data, clean up stale keys, understand the command's underlying mechanics during dictionary resizing, and avoid common pitfalls through practical code examples and performance analysis.
The article outlines Tencent Classroom’s cloud VOD solution, detailing HLS streaming fundamentals, a Mongoose‑based local HTTP proxy with LFU caching and pre‑loading, performance optimizations for latency, buffering, security, and playback reliability, and common transcoding pitfalls with practical fixes, highlighting cloud migration benefits.
This article provides a comprehensive overview of MonetDB, covering its origins at CWI, column‑oriented storage with BATs, memory‑mapped and vectorized execution, three‑layer system architecture, cache‑aware optimizations such as vector operations and radix‑partitioned hash joins, as well as its limitations and reference sources.
The article details iQIYI’s Bubble social service cache architecture, comparing Couchbase and Redis, explaining vBucket design and management UI, and presenting three real‑world optimizations—like‑system key redesign, voting‑system aggregation, and SDK upgrade—along with migration, synchronization, and operational best‑practice recommendations.
The article outlines 27 C++ performance optimization techniques for ray tracing, emphasizing profiling hot paths, minimizing branches and memory accesses, using inline and reference passing, aligning data, loop unrolling, avoiding unnecessary temporaries, and simplifying math to exploit cache locality and modern CPU parallelism.