Tagged articles
Skip List
12 articles · Page 1 of 1
This article walks through essential ByteDance Java interview topics, covering thread safety fundamentals, thread‑pool configuration, Redis performance tricks, Zset and skip‑list internals, memory‑policy handling, cache‑consistency patterns, and MySQL transaction ACID properties, providing code examples and best‑practice recommendations.
Cache ConsistencyJava ConcurrencyMySQL transaction
0 likes · 25 min read

This article provides a comprehensive, formal introduction to skip lists, covering their probabilistic foundations, structural design, detailed C implementations for creation, search, insertion, deletion, random level generation, space and time complexity analyses, and extensions such as fast random access and span maintenance.
AlgorithmComplexity AnalysisSkip List
0 likes · 22 min read

stl4go provides a generic Go 1.18 container library that implements an optimized skip‑list‑based ordered map, using adaptive levels, efficient random‑level generation, type‑specific paths, and cache‑friendly node structures to achieve near‑C++ performance, surpassing existing Go generic collections.
AlgorithmGenericsGo
0 likes · 18 min read

The article details Redis’s internal architecture, explaining how strings use SDS structures, sorted sets rely on skip‑lists, integers are stored in compact intsets, hash tables employ incremental rehashing, ziplist and listpack provide memory‑efficient encodings, the RAX radix tree underpins key lookup and streams, and the threading model has evolved from a single‑threaded event loop to multithreaded I/O for improved concurrency.
RedisSkip ListStream
0 likes · 35 min read

This article provides a comprehensive overview of fundamental data structures and algorithms, covering basic concepts, complexity analysis, case studies, and detailed examinations of structures such as HashMap, Bloom filter, SkipList, AVL, Red‑Black, B+Tree, and HashTree, while discussing their advantages, disadvantages, and typical use cases.
AVL TreeComplexityHashMap
0 likes · 23 min read

This article explains the concept of skip lists as an ordered random data structure, illustrates how Redis uses skip lists for sorted sets, and provides a complete Java implementation with detailed code examples and analysis of their performance characteristics.
AlgorithmJavaRedis
0 likes · 13 min read

This article explains the principles of skip lists, compares them with balanced trees, and provides a complete Go implementation—including interface design, random level generation, search, insertion, deletion, and iteration—while highlighting their space efficiency and ease of use.
InsertionSkip Listdata structures
0 likes · 11 min read

The article explains skip list fundamentals, shows how probabilistic multi‑level indexing yields O(log n) search and O(n) space, provides a complete Go implementation with insertion, deletion and search functions, compares Redis’s enhanced skip list used in sorted sets, and answers common design questions.
Go ProgrammingIndex structureRedis
0 likes · 17 min read

This article explains why Elasticsearch handles complex conditional queries more efficiently than MySQL by using inverted indexes, term dictionaries, skip‑list and roaring bitmap structures, while also discussing the trade‑offs such as slower write performance.
Complex QueriesElasticsearchMySQL
0 likes · 12 min read

This article provides a comprehensive guide to Java's ConcurrentSkipListMap, covering its purpose as a thread‑safe ordered map, the underlying skip‑list data structure, a detailed list of its public methods, in‑depth source‑code analysis for add, remove, and get operations, and a multithreaded example demonstrating its correct behavior compared with TreeMap.
ConcurrencyConcurrentSkipListMapJava
0 likes · 20 min read

LevelDB, Google's high-performance key‑value store built on LSM trees, uses an in‑memory skip‑list, immutable memtables, and sstable files organized in multi‑level compaction, offering interfaces for creation, reads, writes, snapshots, and new features like fuzzy search and JSON storage, all explained with diagrams.
Bloom FilterDatabase ArchitectureLSM-tree
0 likes · 11 min read

This article introduces three advanced data structures—Unrolled List, Bloom Filter, and Skip List—explaining their design motivations, memory and performance trade‑offs, and providing C++ code snippets to illustrate their core implementations.
Bloom FilterSkip ListUnrolled List
0 likes · 8 min read
