BestHub
Sign in
Tagged articles

skiplist

26 articles · Page 1 of 1
Architect's Guide
Architect's Guide
Jun 24, 2026 · Databases

Nine Essential Aspects of Redis: A Comprehensive Technical Guide

This article provides an in‑depth technical overview of Redis, covering its single‑threaded model, core data structures, persistence options, master‑slave replication, Sentinel and cluster architectures, eviction policies, progressive rehash, skiplist implementation, bitmap usage for massive active‑user counting, and strategies for handling MySQL‑Redis write‑through consistency.

Data StructuresPersistenceRedis
0 likes · 30 min read
Nine Essential Aspects of Redis: A Comprehensive Technical Guide
IT Niuke
IT Niuke
Apr 19, 2024 · Databases

Why Does Redis Store the Same Data Twice?

The article explains why Redis stores a single logical collection using two underlying data structures—intset and hashtable for sets, skiplist and ziplist for sorted sets—detailing the encoding rules, upgrade process, example commands, and how this dual‑storage balances O(1) lookups with ordered range queries without duplicating data.

Data StructuresRedisencoding
0 likes · 16 min read
Why Does Redis Store the Same Data Twice?
Liangxu Linux
Liangxu Linux
Jun 6, 2023 · Databases

Why MySQL Chooses B+ Trees Over Skip Lists for Indexing

The article explains the structural differences between B+ trees and skip lists, compares their read‑write performance in MySQL and Redis, and shows why MySQL prefers B+ trees while Redis adopts skip lists for its in‑memory ZSET implementation.

B+TreeIndexingRedis
0 likes · 13 min read
Why MySQL Chooses B+ Trees Over Skip Lists for Indexing
Su San Talks Tech
Su San Talks Tech
May 25, 2023 · Databases

Why MySQL Uses B+ Trees Instead of Skip Lists for Indexing

This article compares B+ trees and skip lists, explaining their structures, insertion and search complexities, and why MySQL chooses B+ trees for disk‑based indexing while Redis prefers skip lists for in‑memory sorted sets, highlighting trade‑offs in read/write performance and I/O costs.

B+TreeIndexingRedis
0 likes · 12 min read
Why MySQL Uses B+ Trees Instead of Skip Lists for Indexing
政采云技术
政采云技术
Oct 18, 2022 · Databases

Understanding Redis Internal Data Structures: SDS, Hash Tables, Ziplist, Quicklist, and Skiplist

This article explains Redis's superior performance by detailing its six underlying data structures—Simple Dynamic Strings, hash tables, ziplist, quicklist, skiplist, and integer sets—covering their implementations, memory optimizations, collision handling, and lookup complexities, with code examples and diagrams.

Data StructuresIn-Memory DatabaseRedis
0 likes · 12 min read
Understanding Redis Internal Data Structures: SDS, Hash Tables, Ziplist, Quicklist, and Skiplist
Java Architect Essentials
Java Architect Essentials
Sep 23, 2022 · Databases

Redis Set and Sorted Set Internal Encodings: intset, Hashtable, Skiplist and Ziplist

This article explains why Redis stores set and sorted‑set objects using two different internal encodings, describes the intset and hashtable representations for sets, the skiplist and ziplist representations for sorted sets, shows the upgrade process with code examples, and lists the common commands for manipulating these data structures.

Data StructuresRedisSet
0 likes · 16 min read
Redis Set and Sorted Set Internal Encodings: intset, Hashtable, Skiplist and Ziplist
IT Architects Alliance
IT Architects Alliance
Jul 31, 2022 · Databases

Why Redis Uses Dual Data Structures for Sets and Sorted Sets

This article explains how Redis internally stores set and sorted‑set objects using intset, hashtable, ziplist, and skiplist encodings, the conditions that trigger each representation, the upgrade process, and the essential Redis commands for manipulating these data structures.

Data StructuresRedisdatabase
0 likes · 16 min read
Why Redis Uses Dual Data Structures for Sets and Sorted Sets
HelloTech
HelloTech
Jul 11, 2022 · Databases

Redis Internal Data Structures: Ziplist, Skiplist, Intset, Quicklist, Zipmap, and Stream

The article explains Redis’s internal low‑level structures—ziplist, skiplist, intset, quicklist, zipmap, and stream—detailing their memory‑efficient layouts, operations, use cases, and how they combine (e.g., quicklist merging linked lists with ziplists) to deliver high performance in the in‑memory database.

Data StructuresMemory optimizationQuicklist
0 likes · 27 min read
Redis Internal Data Structures: Ziplist, Skiplist, Intset, Quicklist, Zipmap, and Stream
ITPUB
ITPUB
Jun 3, 2022 · Backend Development

Unlocking Redis Speed: A Deep Dive into Its Core Data Structures

This article explains why Redis is ultra‑fast by exploring its in‑memory design and the nine fundamental data structures—SDS, linked lists, ziplist, hash tables, skiplist, intset, quicklist, and listpack—that power keys, values, and internal objects, complete with code examples and version‑specific changes.

Backend DevelopmentData StructuresMemory optimization
0 likes · 45 min read
Unlocking Redis Speed: A Deep Dive into Its Core Data Structures
Su San Talks Tech
Su San Talks Tech
Apr 28, 2022 · Databases

Why MySQL Chooses B+ Trees Over Skip Lists for Indexing

This article explains the structures of B+ trees and skip lists, compares their insertion and search behaviors, and shows why MySQL prefers B+ trees for disk‑based indexing while Redis adopts skip lists for in‑memory operations.

B+TreeIndexingRedis
0 likes · 12 min read
Why MySQL Chooses B+ Trees Over Skip Lists for Indexing
IT Services Circle
IT Services Circle
Apr 19, 2022 · Databases

Why MySQL Uses B+ Trees for Indexes Instead of Skip Lists

This article explains the structures of B+ trees and skip lists, compares their read and write performance, and details why MySQL chooses B+ trees for indexing while Redis and RocksDB prefer skip lists, highlighting trade‑offs in disk I/O, fan‑out, and balancing overhead.

B+TreeIndexingRedis
0 likes · 13 min read
Why MySQL Uses B+ Trees for Indexes Instead of Skip Lists
Top Architect
Top Architect
Mar 11, 2022 · Databases

Understanding Redis Set and Sorted Set Internal Encodings: intset, hashtable, skiplist, and ziplist

This article explains how Redis stores Set and Sorted Set objects using dual internal representations—intset and hashtable for sets, skiplist and ziplist for sorted sets—detailing their structures, encoding selection criteria, upgrade processes, command usage, and the reasons behind combining dictionaries with skiplists for optimal performance.

Data StructuresRedisbackend
0 likes · 15 min read
Understanding Redis Set and Sorted Set Internal Encodings: intset, hashtable, skiplist, and ziplist
dbaplus Community
dbaplus Community
Mar 6, 2022 · Backend Development

Why Is Redis So Fast? Unveiling Its Core Data Structures

This article explains how Redis achieves high performance by using specialized in‑memory data structures such as SDS, quicklist, listpack, hash tables, skip‑lists and integer sets, detailing their design, evolution across versions, memory‑efficiency tricks, and the trade‑offs that make Redis a lightning‑fast key‑value store.

Data StructuresListpackQuicklist
0 likes · 43 min read
Why Is Redis So Fast? Unveiling Its Core Data Structures
Tencent Cloud Developer
Tencent Cloud Developer
Jan 26, 2021 · Databases

Understanding Redis Sorted Sets and Their Skiplist Implementation

Redis sorted sets (zsets) combine a hash table with a skiplist that provides O(log N) search, insertion, and deletion, using forward, backward, and span pointers to maintain element order and rank, enabling fast score‑based queries, leaderboards, and range operations via commands such as ZADD, ZRANK, and ZRANGE.

C ProgrammingData StructureSorted Set
0 likes · 15 min read
Understanding Redis Sorted Sets and Their Skiplist Implementation
Big Data Technology Architecture
Big Data Technology Architecture
Apr 16, 2020 · Databases

Memory Management Optimizations in HBase MemStore: SkipList, MemStoreLAB, ChunkPool, Off‑heap and CCSMap

The article systematically explains how HBase's MemStore uses a SkipList‑based model and introduces successive memory‑management optimizations—MemStoreLAB, ChunkPool, off‑heap chunks, CompactingMemStore and the CCSMap data structure—to reduce object overhead, GC pressure and improve throughput.

GCHBaseJava
0 likes · 20 min read
Memory Management Optimizations in HBase MemStore: SkipList, MemStoreLAB, ChunkPool, Off‑heap and CCSMap
dbaplus Community
dbaplus Community
Mar 19, 2020 · Databases

Inside Redis: A Deep Dive into Its Core Data Structures

This article explains the internal implementations of Redis’s five major data structures—simple dynamic strings (SDS), linked lists, dictionaries, skiplists, integer sets, and ziplists—detailing their definitions, memory layouts, key characteristics, and how Redis leverages them for high‑performance storage and retrieval.

Data StructuresDatabase InternalsRedis
0 likes · 12 min read
Inside Redis: A Deep Dive into Its Core Data Structures
Programmer DD
Programmer DD
Jul 25, 2018 · Fundamentals

How SkipList Powers Java’s ConcurrentSkipListMap – A Deep Dive

This article explains the SkipList data structure, its characteristics and operations, and shows how Java’s ConcurrentSkipListMap implements a thread‑safe map using SkipList nodes, index layers, random level generation, and lock‑free algorithms for put, get, remove and size operations.

ConcurrentProgrammingConcurrentSkipListMapDataStructure
0 likes · 21 min read
How SkipList Powers Java’s ConcurrentSkipListMap – A Deep Dive