Tagged articles
HyperLogLog
30 articles · Page 1 of 1
This article walks through the redesign of a high‑traffic, multi‑dimensional DAU counting system that grew from 8 GB of Redis Set memory to a 24 MB HyperLogLog‑based solution supporting 200 million daily active users, 40 k QPS, and flexible time‑window queries while keeping latency under 20 ms.
DAUHyperLogLogKafka
0 likes · 38 min read

This article walks through ten advanced Redis features—including Bloom filters, Redisson distributed locks, delayed queues, token‑bucket rate limiting, bitmaps, HyperLogLog, GEO, Streams, Lua scripts, and RedisJSON—explaining their principles, pros and cons, typical scenarios, and providing complete Spring Boot code examples.
BitmapBloom FilterDistributed Lock
0 likes · 23 min read

This article provides an in‑depth guide to Redis’s advanced capabilities, covering how to use pipeline for batch commands, transactions for ordered execution, Lua scripts for atomic logic, distributed locks with proper token handling, reliable messaging with streams, and specialized data structures such as BitMap, HyperLogLog, Bloom Filter and GEO for efficient large‑scale scenarios.
Bloom FilterDistributed LockGEO
0 likes · 65 min read

The article dissects an Alibaba interview question on counting 100 million daily active users, showing why HyperLogLog’s error and lack of per‑user state make it unsuitable, and presents a detailed Bitmap‑based architecture—including sharding, pre‑computation, and ClickHouse integration—to achieve precise, high‑performance analytics.
BitmapClickHouseDailyActiveUsers
0 likes · 16 min read

GreptimeDB solves front‑end observability challenges with a distributed architecture (frontend, datanode, flownode, metasrv), transparent two‑level caching, elastic scaling, and an SQL‑based flow engine for real‑time multi‑granularity aggregation and approximate counting, delivering millisecond query latency and cost‑effective storage.
GreptimeDBHyperLogLogSQL
0 likes · 12 min read

This article explains three Redis-based methods—Hash, Bitmap, and HyperLogLog—for tracking website user visits, detailing how each structure works, their implementation steps, memory and accuracy trade‑offs, and guidance on choosing the best approach for different traffic scenarios.
BitmapDatabase PerformanceHash
0 likes · 6 min read

This article introduces Redis's five extended data types—Stream, Geospatial, Bitmap, Bitfield, and HyperLogLog—explaining their concepts, common commands, and practical code examples, and highlights how they address specific internet‑scale scenarios more efficiently than traditional relational solutions.
BitfieldBitmapGeospatial
0 likes · 6 min read


ITPUBAug 27, 2023 · Databases
This article explains how to leverage Redis Set, Sorted Set, Bitmap, and HyperLogLog data structures for various statistical scenarios such as user sign‑in tracking, friend recommendations, comment ranking, and UV counting, while addressing performance and memory considerations.
BitmapDifferenceHyperLogLog
0 likes · 11 min read

This article explains how to leverage Redis data structures such as Set, Sorted Set, Bitmap, and HyperLogLog to perform aggregation, sorted, binary‑state, and cardinality statistics efficiently in large‑scale applications, while addressing performance considerations and practical implementation details.
BackendHyperLogLogRedis
0 likes · 10 min read

This article explains how to use Redis sets, sorted sets, lists, bitmaps, and HyperLogLog to perform aggregation, ordered queries, binary state tracking, and cardinality estimation for large‑scale applications such as sign‑in systems, e‑commerce comments, and social‑network friend lists.
BackendBitmapHyperLogLog
0 likes · 10 min read

This article explains Redis HyperLogLog, its underlying principles, memory efficiency, typical use cases like UV/PV counting, and provides practical command examples (PFADD, PFCOUNT, PFMERGE) to perform high‑performance cardinality estimation on massive datasets.
CardinalityHyperLogLogPFADD
0 likes · 9 min read

The article explains cardinality counting in Presto, comparing exact set‑based methods with memory‑efficient bitmap, Linear Count, and HyperLogLog approximations, detailing their algorithms, implementation in Presto’s query engine, and offering best‑practice recommendations for choosing the appropriate technique in business workloads.
BitmapHyperLogLogSQL
0 likes · 16 min read

This article explains why Redis’s single‑threaded design achieves high performance, details its five fundamental data types—string, list, set, hash, and sorted set—their internal implementations, and introduces advanced structures such as Geo, Bitmap, and HyperLogLog with practical command examples.
BitmapGeospatialHyperLogLog
0 likes · 23 min read

This article explains how to use Redis data structures—Set, Hash, Bitmap, and HyperLogLog—along with Redisson in Java to efficiently count unique page visitors (UV) in high‑traffic mobile internet scenarios, comparing memory usage, precision, and scalability.
HashHyperLogLogRedis
0 likes · 12 min read

This article explains how Citus extends PostgreSQL for distributed execution, detailing supported aggregation functions, count‑distinct handling, HyperLogLog columns, Top‑N estimation, percentile sketches with t‑digest, limit push‑down, view support, and various join strategies, while providing concrete SQL examples and configuration tips.
CitusHyperLogLogJoins
0 likes · 16 min read

This tutorial shows how to use Citus, a distributed PostgreSQL extension, to ingest immutable HTTP event logs, shard them by site_id, create real‑time and pre‑aggregated tables, schedule roll‑up jobs, handle data expiration, estimate distinct counts with HyperLogLog, and store unstructured JSONB counters for a low‑latency analytics dashboard.
CitusHyperLogLogJSONB
0 likes · 16 min read

This article explains how to select Redis data structures such as Bitmap, HyperLogLog, Set, List, Sorted Set, and Hash to efficiently handle massive statistical scenarios like user login status, UV counting, ranking, and set aggregation, while providing concrete command examples and best‑practice recommendations.
BitmapCardinalityHyperLogLog
0 likes · 11 min read

This article explores the HyperLogLog algorithm for cardinality estimation, tracing its development from Linear and LogLog counting, detailing its Redis implementation with sparse and dense encodings and command workflows, and presenting experiments that demonstrate its memory efficiency and analyze observed error rates versus the theoretical 0.81% standard deviation.
AlgorithmHyperLogLogRedis
0 likes · 13 min read

The article explains how to choose appropriate Redis data structures—such as Bitmap, HyperLogLog, Set, List, Hash, and Sorted Set—to efficiently handle massive statistical scenarios like UV counting, ranking, and set‑based aggregation, while providing concrete command examples and performance considerations.
HyperLogLogRedisSorted Set
0 likes · 13 min read

This article explains how to choose the right Redis data structures—Bitmap, HyperLogLog, Set, List, and Sorted Set—to efficiently handle massive statistical scenarios such as UV counting, ranking, and aggregation in high‑traffic mobile applications.
BitmapData StatisticsHyperLogLog
0 likes · 14 min read

This article explains three Redis-based techniques—Hash, Bitset, and HyperLogLog—for efficiently counting daily page visits, detailing command usage, memory trade‑offs, and accuracy considerations, helping backend engineers implement scalable visitor statistics in high‑traffic environments like large e‑commerce platforms.
BitsetHashHyperLogLog
0 likes · 6 min read

This article details the evolution of a WeChat live‑room chat component from its 1.0 high‑performance design to a 2.0 architecture that overcomes scalability, reliability, and traffic‑isolation challenges, enabling a single room to support up to 15 million simultaneous online users.
ChatroomHyperLogLogdistributed systems
0 likes · 13 min read

This article explains the cardinality‑counting problem behind DAU/MAU and unique visitor metrics, compares naïve solutions like Set, Bitmap and Bloom filter, introduces big‑data algorithms such as Linear Counting, LogLog and HyperLogLog, and shows how Redis implements HyperLogLog with dense and sparse storage optimizations.
AlgorithmCardinalityHyperLogLog
0 likes · 17 min read

This article explains how to use Redis sets, sorted sets, bitmaps, and HyperLogLog for various aggregation, sorting, binary state, and cardinality statistics, providing concrete command examples, design patterns, and performance considerations for large‑scale applications.
BackendBitmapData Modeling
0 likes · 11 min read

This article walks through nine practical Redis use cases—including basic KV caching, distributed locking, delayed queues, rate limiting, service discovery, bitmap storage, HyperLogLog counting, roaring bitmaps, and Bloom filters—explaining the underlying concepts, configuration tips, and code examples for robust backend development.
BitmapBloom FilterCaching
0 likes · 20 min read

The article explains three Redis-based techniques—Hash, Bitset, and HyperLogLog—for counting daily page visits on high‑traffic sites, detailing command usage, memory trade‑offs, and the pros and cons of each method.
BitsetHashHyperLogLog
0 likes · 6 min read

The article explains Reddit's large‑scale page‑view counting system, detailing its real‑time requirements, the challenges of naive hash‑set storage, and how a hybrid approach using linear probability and HyperLogLog algorithms together with Kafka, Redis, and Cassandra achieves accurate, low‑memory, near‑real‑time analytics.
HyperLogLogKafkaReddit
0 likes · 7 min read

The article explains how pre‑aggregation combined with the HyperLogLog algorithm and Spark‑Alchemy's native HLL functions can dramatically accelerate distinct‑count calculations in big‑data workloads while maintaining low error rates and cross‑system compatibility.
Approximate Distinct CountHyperLogLogSpark
0 likes · 7 min read


ITPUBDec 21, 2019 · Databases
This article explains three Redis‑based techniques—using hash tables, bitsets, and the HyperLogLog probabilistic algorithm—to accurately count daily page views, detailing the required commands, implementation steps, advantages, and limitations for high‑traffic sites.
BitsetHashHyperLogLog
0 likes · 6 min read

This article explains practical methods for deduplicating and counting data in operational analytics using Redis, covering SET, ZSET, BITSET, HyperLogLog, and Bloom filter structures, their advantages, limitations, and suitable scenarios for real‑time and large‑scale metric calculations.
HyperLogLogRedisdeduplication
0 likes · 10 min read
