BestHub
Sign in
Tagged articles
630 articles
Page 5 of 7
Architect's Tech Stack
Architect's Tech Stack
Dec 18, 2020 · Databases

How to Use Redis to Count Website Visits: Hash, Bitset, and Probabilistic Algorithms

This article explains three Redis-based approaches—using Hashes, Bitsets, and the HyperLogLog probabilistic algorithm—to count daily website visits, detailing command usage, advantages, disadvantages, and implementation considerations for high‑traffic sites, including handling logged‑in and anonymous users, memory consumption, and accuracy trade‑offs.

Backend DevelopmentData StructuresProbabilistic Algorithms
0 likes · 6 min read
How to Use Redis to Count Website Visits: Hash, Bitset, and Probabilistic Algorithms
360 Tech Engineering
360 Tech Engineering
Dec 11, 2020 · Fundamentals

Heap Sort: Theory, Implementation, and Step‑by‑Step Explanation

This article explains the heap sort algorithm, describing the heap data structure, the process of building a max‑heap, the sorting loop with element swaps, and provides detailed Java code examples along with key points and an illustrative example array.

Data StructuresSorting Algorithmalgorithm tutorial
0 likes · 5 min read
Heap Sort: Theory, Implementation, and Step‑by‑Step Explanation
ITPUB
ITPUB
Dec 7, 2020 · Databases

Why Redis Is So Fast: Inside Its Memory Design and Data Structures

This article explains how Redis achieves high performance by using an in‑memory architecture, specialized data structures such as SDS, doubly linked lists, ziplists and skip‑lists, efficient encoding strategies, and a single‑threaded I/O multiplexing model that eliminates costly context switches.

BackendData StructuresIn-Memory Database
0 likes · 12 min read
Why Redis Is So Fast: Inside Its Memory Design and Data Structures
New Oriental Technology
New Oriental Technology
Dec 7, 2020 · Fundamentals

Efficient Circuit Connection Modeling with a Circular Doubly Linked List

The article compares an adjacency‑list approach and a circular doubly linked list for representing circuit connections, showing that the linked‑list method achieves O(1) connect/disconnect operations with linear space, making it the most efficient and simple solution for graph‑based circuit modeling.

Data Structuresalgorithmcircuit modeling
0 likes · 4 min read
Efficient Circuit Connection Modeling with a Circular Doubly Linked List
ITFLY8 Architecture Home
ITFLY8 Architecture Home
Dec 1, 2020 · Databases

Why Redis Dominates Modern Caching: Features, Architecture, and Best Practices

Redis, an in‑memory C‑language database, offers ultra‑fast read/write speeds, rich data structures, persistence, clustering, and multi‑threaded I/O, making it ideal for distributed caching, locks, queues, and more; this guide explains its fundamentals, comparisons with Memcached, data types, eviction policies, and operational best practices.

CacheData Structuresdatabase
0 likes · 36 min read
Why Redis Dominates Modern Caching: Features, Architecture, and Best Practices
Architecture Digest
Architecture Digest
Nov 18, 2020 · Backend Development

Deep Dive into Java ConcurrentHashMap: Implementation, Concurrency Mechanisms, and Core Methods

This article provides a comprehensive analysis of Java's ConcurrentHashMap, covering its historical evolution, key internal fields, the thread‑safe put and remove operations, the complex resizing and transfer mechanisms, and auxiliary methods such as size, get, and clear, all illustrated with original source code.

ConcurrentHashMapData StructuresJDK
0 likes · 24 min read
Deep Dive into Java ConcurrentHashMap: Implementation, Concurrency Mechanisms, and Core Methods
MaGe Linux Operations
MaGe Linux Operations
Oct 28, 2020 · Fundamentals

Master Python Tricks: Function Chaining, Default Argument Pitfalls, CSV I/O, and More

This article showcases a collection of practical Python snippets covering function chaining, mutable default argument traps, CSV reading and writing, number base conversion, JSON formatting, list flattening and merging, most‑common character counting, safe eval usage, matrix transposition, list comprehensions, permutations/combinations, defaultdict usage, and dictionary reversal techniques.

AlgorithmsData StructuresPython
0 likes · 6 min read
Master Python Tricks: Function Chaining, Default Argument Pitfalls, CSV I/O, and More
Python Programming Learning Circle
Python Programming Learning Circle
Oct 27, 2020 · Fundamentals

Useful Python Code Snippets for Everyday Tasks

This article presents a collection of practical Python snippets covering string reversal, title‑casing, set‑based deduplication, list multiplication, list comprehensions, variable swapping, splitting, joining, palindrome checking, Counter usage, dictionary merging, timing, flattening, random sampling, digit extraction, uniqueness testing and more, each illustrated with clear code examples.

AlgorithmsData StructuresPython
0 likes · 10 min read
Useful Python Code Snippets for Everyday Tasks
Architecture Digest
Architecture Digest
Oct 22, 2020 · Backend Development

Kafka Timing Wheel: Design, Operation, and Code Walkthrough

The article explains how Kafka handles timeout‑based requests using a Timing Wheel data structure, detailing its design, parameters, operation principles, overflow handling, and providing Scala code examples that illustrate O(1) task insertion compared to traditional O(logN) delay queues.

Data StructuresKafkaScala
0 likes · 10 min read
Kafka Timing Wheel: Design, Operation, and Code Walkthrough
Programmer DD
Programmer DD
Oct 19, 2020 · Fundamentals

ArrayList vs LinkedList: When Each Data Structure Truly Shines

This article benchmarks Java's ArrayList and LinkedList by measuring insertion and lookup times at the head, tail, and middle of a list with 100,000 elements, then explains the underlying source‑code mechanisms that cause the observed performance differences.

BenchmarkData StructuresJava
0 likes · 10 min read
ArrayList vs LinkedList: When Each Data Structure Truly Shines
Sohu Tech Products
Sohu Tech Products
Oct 14, 2020 · Fundamentals

Understanding JavaScript Arrays and Objects: Operations and Big O Complexity

This article explains when to use JavaScript arrays versus objects by describing their memory layout, common operations such as adding, removing, and searching elements, and analyzing each operation's time complexity using Big O notation, while also covering hash collisions and practical performance considerations.

ArraysBig OData Structures
0 likes · 12 min read
Understanding JavaScript Arrays and Objects: Operations and Big O Complexity
IT Xianyu
IT Xianyu
Oct 10, 2020 · Fundamentals

How to Choose Between HashMap and TreeMap in Java

HashMap and TreeMap serve different purposes in Java: HashMap offers fast, unordered access using hash codes, while TreeMap maintains keys in sorted order via a red‑black tree, and the article explains their implementations, performance trade‑offs, and how to customize TreeMap ordering with comparators.

CollectionsComparatorData Structures
0 likes · 5 min read
How to Choose Between HashMap and TreeMap in Java
Liangxu Linux
Liangxu Linux
Oct 9, 2020 · Fundamentals

Master Interview‑Ready Algorithms & Data Structures with This Open‑Source Guide

This article introduces a popular open‑source repository that compiles essential algorithms and data‑structure concepts for technical interviews, providing concise definitions, time‑complexity analyses, and example code for structures such as stacks, queues, trees, graphs, and sorting algorithms, along with a GitHub link.

AlgorithmsData StructuresGitHub
0 likes · 9 min read
Master Interview‑Ready Algorithms & Data Structures with This Open‑Source Guide
Architecture Digest
Architecture Digest
Oct 3, 2020 · Databases

Redis vs Memcached: A Comprehensive Comparison

This article systematically compares Redis and Memcached across thread models, data structures, eviction policies, pipelining and transactions, persistence, high availability, and clustering, helping developers choose the most suitable in‑memory database for their specific business requirements.

Data StructuresIn-Memory DatabaseMemcached
0 likes · 11 min read
Redis vs Memcached: A Comprehensive Comparison
OPPO Kernel Craftsman
OPPO Kernel Craftsman
Sep 18, 2020 · Fundamentals

Linux SCSI Subsystem Architecture and Design Framework

The article thoroughly examines the Linux SCSI subsystem architecture, illustrating how abstract hardware topology—hosts, channels, IDs, and LUNs—is modeled in software through structs such as scsi_host and scsi_device, and detailing initialization, scanning, path establishment, power management, and block‑layer integration to guide kernel storage driver design.

Block LayerData StructuresLinux kernel
0 likes · 20 min read
Linux SCSI Subsystem Architecture and Design Framework
vivo Internet Technology
vivo Internet Technology
Sep 16, 2020 · Backend Development

How ConcurrentHashMap Guarantees Thread‑Safe Reads and Writes: A Deep Dive into C13Map Internals

This article explains the fundamentals of HashMap, then dissects the internal fields, node‑array safety, read‑path guarantees, write‑path locking, atomic compute methods, resize‑transfer mechanics, traverser design, and bulk‑task support that together make Java's ConcurrentHashMap (C13Map) a highly concurrent, lock‑free data structure.

ConcurrentHashMapData StructuresHashMap
0 likes · 49 min read
How ConcurrentHashMap Guarantees Thread‑Safe Reads and Writes: A Deep Dive into C13Map Internals
ITPUB
ITPUB
Sep 11, 2020 · Fundamentals

How Redis Implements Binary‑Safe Strings with Simple Dynamic Strings (SDS)

This article explains the design and evolution of Redis's Simple Dynamic Strings (SDS), covering the original pre‑3.2 structure, the newer type‑specific headers, the core API functions for creating, clearing, and concatenating SDS objects, and the memory‑reallocation strategy that ensures binary safety and efficient storage.

Binary SafetyCData Structures
0 likes · 13 min read
How Redis Implements Binary‑Safe Strings with Simple Dynamic Strings (SDS)
Hulu Beijing
Hulu Beijing
Sep 11, 2020 · Fundamentals

Crack Hulu’s 2020 Campus Coding Test: 4 Algorithm Challenges Explained

This article walks you through Hulu's 2021 campus recruitment update, explains the online programming test schedule and format, shares interview tips, and provides detailed statements, sample I/O, and solution analyses for four algorithmic problems covering probability, array maxima, maze navigation, and segment‑tree optimization.

Data Structuresalgorithmcoding interview
0 likes · 15 min read
Crack Hulu’s 2020 Campus Coding Test: 4 Algorithm Challenges Explained
Wukong Talks Architecture
Wukong Talks Architecture
Sep 9, 2020 · Fundamentals

Comprehensive Guide to Java Queue Family: 18 Types, Interfaces, and Implementations

This article provides an in‑depth, illustrated overview of Java's Queue hierarchy, covering 18 concrete queue classes, their inheritance relationships, core methods, blocking and non‑blocking variants, practical usage examples, and code snippets to help developers master queue-based data structures and concurrency utilities.

BlockingQueueData StructuresJava
0 likes · 26 min read
Comprehensive Guide to Java Queue Family: 18 Types, Interfaces, and Implementations
Full-Stack Internet Architecture
Full-Stack Internet Architecture
Sep 4, 2020 · Databases

Comprehensive Guide to Redis Data Structures, Persistence, Transactions, Clustering, and Applications

This article provides an in‑depth technical overview of Redis, covering its core data structures, memory allocation strategies, eviction policies, persistence mechanisms (RDB and AOF), transaction model, sentinel and cluster architectures, Pub/Sub messaging, and multiple approaches to implementing distributed locks.

Data StructuresPersistencePubSub
0 likes · 89 min read
Comprehensive Guide to Redis Data Structures, Persistence, Transactions, Clustering, and Applications
MaGe Linux Operations
MaGe Linux Operations
Sep 1, 2020 · Fundamentals

Boost Python Speed: 10 Proven Tricks to Accelerate Your Code

This article presents practical Python performance‑boosting techniques—including avoiding global variables, minimizing attribute access, eliminating unnecessary abstractions, reducing data copies, optimizing loops, leveraging built‑in functions, and using tools like numba—each illustrated with before‑and‑after code snippets and measured speed improvements.

BenchmarkingData Structurescode
0 likes · 19 min read
Boost Python Speed: 10 Proven Tricks to Accelerate Your Code
Alibaba Cloud Developer
Alibaba Cloud Developer
Aug 12, 2020 · Fundamentals

Unlock Core Data Structures, Algorithms, and Sorting Basics

This article provides a comprehensive introduction to fundamental data structures, core algorithm concepts, and classic sorting techniques, explaining their definitions, basic operations, time and space complexities, stability considerations, and practical use cases for developers seeking to strengthen their programming foundations.

AlgorithmsData StructuresSorting
0 likes · 20 min read
Unlock Core Data Structures, Algorithms, and Sorting Basics
Architect's Tech Stack
Architect's Tech Stack
Aug 10, 2020 · Fundamentals

Understanding Java HashMap and ConcurrentHashMap: Structure, Operations, and Performance

This article explains the internal structure of Java's HashMap and ConcurrentHashMap, covering hash calculations, bucket arrays, linked‑list and red‑black tree conversions, load factor and resizing behavior, as well as the differences in concurrency control between JDK 1.7 and 1.8 implementations.

ConcurrentHashMapData StructuresHashMap
0 likes · 13 min read
Understanding Java HashMap and ConcurrentHashMap: Structure, Operations, and Performance
Programmer DD
Programmer DD
Jul 23, 2020 · Fundamentals

When to Use HashMap vs TreeMap in Java? A Practical Guide

This article explains the differences between Java's HashMap and TreeMap, covering their underlying implementations, performance characteristics, thread safety, and how to customize TreeMap for descending order, helping developers choose the right map for their needs.

CollectionsData StructuresHashMap
0 likes · 7 min read
When to Use HashMap vs TreeMap in Java? A Practical Guide
Liulishuo Tech Team
Liulishuo Tech Team
Jul 22, 2020 · Fundamentals

Exploring Recursive Types in Go: Tries, Finite Automata, Stacks, Pointers, Balanced Braces, Y Combinator, and Church Numerals

This article demonstrates how Go's support for recursive types enables elegant implementations of data structures such as tries and finite automata, functional constructs like stacks and pointers, and classic concepts including balanced braces, the Y combinator, and Church numerals, providing practical code examples throughout.

AlgorithmsData StructuresGo
0 likes · 16 min read
Exploring Recursive Types in Go: Tries, Finite Automata, Stacks, Pointers, Balanced Braces, Y Combinator, and Church Numerals
Liangxu Linux
Liangxu Linux
Jul 20, 2020 · Fundamentals

Essential Big O Cheat Sheet: Quick Reference for Algorithm Complexity

This article presents a concise Big O cheat sheet that aggregates the time‑complexity notations for common data structures, sorting algorithms, graph and heap operations, and visualizes performance curves, helping readers quickly recall best‑, worst‑, and average‑case scenarios.

Big OCheat SheetData Structures
0 likes · 3 min read
Essential Big O Cheat Sheet: Quick Reference for Algorithm Complexity
Selected Java Interview Questions
Selected Java Interview Questions
Jul 14, 2020 · Backend Development

Deep Dive into Java HashMap: Implementation Details, Internals, and Interview Questions

This article explains the internal design of Java's HashMap—including its default capacity, load factor, underlying array‑list‑tree structure, hash calculation, resizing algorithm, treeification, and common interview questions—while providing complete source code snippets and practical usage tips for developers.

CollectionsData StructuresHashMap
0 likes · 22 min read
Deep Dive into Java HashMap: Implementation Details, Internals, and Interview Questions
OPPO Kernel Craftsman
OPPO Kernel Craftsman
Jul 10, 2020 · Information Security

Linux Kernel Crypto Framework: Architecture, Data Structures, and Application in File System Encryption

The Linux kernel’s generic crypto framework, introduced in version 2.5.45, defines core structures such as crypto_template, crypto_alg, crypto_instance and crypto_tfm to dynamically register and combine algorithms (e.g., ecb(aes)), providing a uniform API for symmetric, asymmetric, hash and other primitives, supporting user‑space access via AF_ALG and practical use cases like Android file‑based encryption with built‑in self‑tests for correctness.

Data StructuresLinux kernelSelf-test
0 likes · 11 min read
Linux Kernel Crypto Framework: Architecture, Data Structures, and Application in File System Encryption
Programmer DD
Programmer DD
Jun 27, 2020 · Fundamentals

Why Does Java’s HashMap Use a 0.75 Load Factor? The Math Behind It

This article explains why Java's HashMap adopts a default load factor of 0.75, covering hash table basics, collision‑resolution strategies, the Poisson‑distribution analysis that justifies the value, and the trade‑offs between space efficiency and lookup performance.

Data StructuresHashMapJava
0 likes · 11 min read
Why Does Java’s HashMap Use a 0.75 Load Factor? The Math Behind It
Open Source Tech Hub
Open Source Tech Hub
Jun 25, 2020 · Backend Development

Mastering Redis: Core Data Structures and Practical Commands Explained

This comprehensive guide explores Redis fundamentals, detailing its six primary data structures—strings, lists, hashes, sets, sorted sets, and streams—along with practical command examples, internal implementations, and usage patterns for high‑performance backend development.

CacheData StructuresMessage Queue
0 likes · 17 min read
Mastering Redis: Core Data Structures and Practical Commands Explained
Python Programming Learning Circle
Python Programming Learning Circle
Jun 15, 2020 · Fundamentals

30 Python Best Practices, Tips, and Tricks

This article presents thirty practical Python best‑practice tips covering version checks, IPython usage, list comprehensions, memory inspection, multiple return values, data classes, variable swapping, dictionary merging, string manipulation, ternary operators, counters, comparison chaining, color output, date parsing, integer division, character‑set detection and more, each illustrated with concise code examples.

Data StructuresTipsbest practices
0 likes · 17 min read
30 Python Best Practices, Tips, and Tricks
AntTech
AntTech
Jun 8, 2020 · Fundamentals

What Is Programming? A Simple Introduction Using a Cooking Analogy

The article explains programming fundamentals by likening code to cooking, defining programming as algorithms plus data structures, illustrating basic concepts such as conditionals, loops, and abstraction through simple code examples, and emphasizing the difference between novice and expert approaches.

AlgorithmsData StructuresSoftware Engineering
0 likes · 8 min read
What Is Programming? A Simple Introduction Using a Cooking Analogy
Liangxu Linux
Liangxu Linux
Jun 6, 2020 · Fundamentals

Why Programmers Must Master Data Structures, OS, Compilers & Architecture

This answer explains why ordinary programmers should study core computer science subjects—data structures and algorithms, operating systems, compiler theory, and computer organization—illustrating each with practical examples, typical use cases, and the benefits they bring to real‑world software development.

AlgorithmsData StructuresOperating Systems
0 likes · 10 min read
Why Programmers Must Master Data Structures, OS, Compilers & Architecture
macrozheng
macrozheng
Jun 3, 2020 · Fundamentals

Master the 10 Essential Data Structures: From Arrays to Graphs

This article provides a comprehensive visual guide to ten fundamental data structures—including arrays, linked lists, skip lists, stacks, queues, trees, heaps, hash tables, and graphs—explaining their concepts, characteristics, and typical use cases for programmers and interview preparation.

AlgorithmsData StructuresInterview Preparation
0 likes · 22 min read
Master the 10 Essential Data Structures: From Arrays to Graphs
Liangxu Linux
Liangxu Linux
May 31, 2020 · Fundamentals

Master the Top 10 Classic Sorting Algorithms with Code and Visualizations

This article systematically presents ten classic sorting algorithms—bubble, selection, insertion, quick, heap, merge, shell, counting, bucket, and radix—detailing their concepts, time and space complexities, step‑by‑step logic, animated illustrations, and complete source code examples in C++ and JavaScript.

C++Data StructuresJavaScript
0 likes · 19 min read
Master the Top 10 Classic Sorting Algorithms with Code and Visualizations
ITPUB
ITPUB
May 26, 2020 · Databases

Master Redis: Core Data Types, Commands, and Advanced Features Explained

Redis is a high‑performance, open‑source key‑value store offering persistence, rich data structures, replication, pub/sub, transactions, and clustering; this guide explains its fundamentals, data types (string, hash, list, set, sorted set), essential commands, and advanced features such as persistence options, replication, Sentinel, and sharding.

Data StructuresPersistenceTransactions
0 likes · 16 min read
Master Redis: Core Data Types, Commands, and Advanced Features Explained
Selected Java Interview Questions
Selected Java Interview Questions
May 26, 2020 · Fundamentals

Eight Common Data Structures Every Programmer Should Know

This article introduces eight fundamental data structures—arrays, linked lists, stacks, queues, hash tables, trees, heaps, and graphs—explaining their definitions, core operations, typical applications, and visual illustrations to help programmers master essential concepts for software development and technical interviews.

ArrayData StructuresQueue
0 likes · 12 min read
Eight Common Data Structures Every Programmer Should Know
Sohu Tech Products
Sohu Tech Products
May 20, 2020 · Fundamentals

Understanding Red‑Black Tree Insertion Cases and Rotations

This article provides a comprehensive tutorial on red‑black trees, covering binary search tree fundamentals, the five classic insertion cases, recoloring rules, left and right rotations, and a step‑by‑step example of inserting a new node while preserving all red‑black properties.

AlgorithmsData StructuresInsertion
0 likes · 8 min read
Understanding Red‑Black Tree Insertion Cases and Rotations
Laravel Tech Community
Laravel Tech Community
May 16, 2020 · Fundamentals

Master PHP Sorting Algorithms: Insertion, Selection, Bubble, Quick, Shell & More

This comprehensive guide walks through classic PHP sorting techniques—including insertion, selection, bubble, quick, and shell sorts—along with essential string utilities such as length calculation, reversal, comparison, substring search, replacement, insertion, deletion, copying, concatenation, simple encoding/decoding, and basic encryption/decryption, providing clear explanations and ready‑to‑run code examples for each algorithm.

AlgorithmsData StructuresPHP
0 likes · 15 min read
Master PHP Sorting Algorithms: Insertion, Selection, Bubble, Quick, Shell & More
Full-Stack Internet Architecture
Full-Stack Internet Architecture
May 15, 2020 · Fundamentals

Understanding Red-Black Tree Insertion Operations

This article provides a comprehensive, step‑by‑step explanation of red‑black tree insertion, covering binary search tree basics, red‑black properties, the five insertion cases, color changes, left and right rotations, and detailed visual examples to help readers fully master the data structure.

BalancingData StructuresInsertion
0 likes · 8 min read
Understanding Red-Black Tree Insertion Operations
Sohu Tech Products
Sohu Tech Products
May 13, 2020 · Fundamentals

Deep Dive into Java HashMap: Implementation, hashCode/equals, Collision Handling, and Interview Questions

This article provides a comprehensive overview of Java's HashMap, covering its place in the Set and Map families, internal implementation details, the relationship between hashCode() and equals(), collision resolution strategies, basic operations, differences from Hashtable, and several classic interview problems such as Top‑K frequency and LRU cache design.

CollisionData StructuresHashMap
0 likes · 14 min read
Deep Dive into Java HashMap: Implementation, hashCode/equals, Collision Handling, and Interview Questions
Python Crawling & Data Mining
Python Crawling & Data Mining
May 13, 2020 · Fundamentals

Master Python Lists, Tuples, and Dictionaries: Essential Guide with Code Examples

This article introduces Python’s core data structures—lists, tuples, and dictionaries—explaining their definitions, indexing, slicing, iteration, modification, and common operations, and provides clear code examples for creating, accessing, updating, and deleting elements, helping beginners deepen their programming fundamentals.

Data StructuresListPython
0 likes · 13 min read
Master Python Lists, Tuples, and Dictionaries: Essential Guide with Code Examples
Selected Java Interview Questions
Selected Java Interview Questions
May 6, 2020 · Fundamentals

Understanding HashMap Internals: Table Initialization, Resizing, and Load Factor

This article explains the inner workings of Java's HashMap, covering its array‑plus‑linked‑list (or red‑black tree) structure, lazy table initialization, default capacity and threshold, resizing mechanics, the rationale behind power‑of‑two table lengths, index calculation using bitwise AND, and the significance of the 0.75 load factor.

Data StructuresHashMapJava
0 likes · 18 min read
Understanding HashMap Internals: Table Initialization, Resizing, and Load Factor
Architect's Tech Stack
Architect's Tech Stack
May 2, 2020 · Fundamentals

Comprehensive Overview of the Java Collection Framework: Interfaces, Implementations, and Usage

This article provides a detailed walkthrough of Java's collection framework, covering the hierarchy of interfaces and abstract classes, the characteristics of List, Set, and Map implementations, iterator mechanisms, common pitfalls, and practical code examples to help developers choose and use the appropriate collection types effectively.

CollectionsData StructuresIterators
0 likes · 31 min read
Comprehensive Overview of the Java Collection Framework: Interfaces, Implementations, and Usage
Selected Java Interview Questions
Selected Java Interview Questions
Apr 30, 2020 · Fundamentals

Java Collections Framework Interview Questions and Answers

This article compiles a comprehensive set of Java Collections Framework interview questions, explaining its purpose, advantages, generic benefits, core interfaces, iterator behavior, fail‑fast vs fail‑safe, map views, differences among implementations, thread‑safety, and sorting mechanisms.

CollectionsData StructuresGenerics
0 likes · 18 min read
Java Collections Framework Interview Questions and Answers
macrozheng
macrozheng
Apr 29, 2020 · Fundamentals

Mastering Java HashMap: From Basics to Interview Mastery

This article explains the fundamentals of Java's HashMap, covering its relationship to Set and Map families, internal implementation details, hashCode/equals contracts, collision resolution strategies, basic operations with code examples, and common interview questions such as Top‑K and LRU cache design.

Data StructuresHash CollisionHashMap
0 likes · 18 min read
Mastering Java HashMap: From Basics to Interview Mastery
Efficient Ops
Efficient Ops
Apr 28, 2020 · Databases

Master Redis: Core Concepts, Commands, and Data Types Explained

This article introduces Redis as an open‑source in‑memory data‑structure store, explains its role as a NoSQL database, covers fundamental data types, common commands, expiration handling, and advanced features like pipelines and transactions, providing a comprehensive guide for developers.

CacheData StructuresIn-Memory Database
0 likes · 15 min read
Master Redis: Core Concepts, Commands, and Data Types Explained
Full-Stack Internet Architecture
Full-Stack Internet Architecture
Apr 26, 2020 · Fundamentals

Understanding ConcurrentHashMap: Implementation Differences between JDK 1.7 and JDK 1.8

This article explains why ConcurrentHashMap provides thread‑safe and high‑performance map operations, compares it with HashMap and Hashtable, and details the architectural changes from JDK 1.7’s segment‑lock design to JDK 1.8’s array‑list‑red‑black‑tree and CAS‑based implementation.

ConcurrentHashMapData StructuresJDK7
0 likes · 7 min read
Understanding ConcurrentHashMap: Implementation Differences between JDK 1.7 and JDK 1.8
OPPO Kernel Craftsman
OPPO Kernel Craftsman
Apr 24, 2020 · Fundamentals

Evolution from Radix Tree to XArray in the Linux Kernel

The Linux kernel’s page‑cache indexing migrated from the classic radix‑tree structure—using shift‑based multi‑way nodes, RCU‑protected insert, lookup, and delete operations—to the newer XArray API introduced in 4.20, which retains the radix layout while offering automatic resizing, built‑in locking, richer marking, and a cleaner, safer interface.

Data StructuresLinux kernelRCU
0 likes · 17 min read
Evolution from Radix Tree to XArray in the Linux Kernel
Mike Chen's Internet Architecture
Mike Chen's Internet Architecture
Apr 24, 2020 · Fundamentals

Comprehensive Introduction to Binary Trees in Java

This article provides a detailed overview of binary trees, covering their definition, traversal methods, various types such as full, complete, BST, and AVL trees, along with their characteristics, advantages, disadvantages, and time‑complexity considerations for Java developers.

AVLAlgorithmsBST
0 likes · 7 min read
Comprehensive Introduction to Binary Trees in Java
Python Programming Learning Circle
Python Programming Learning Circle
Apr 21, 2020 · Fundamentals

9 Common Python Interview Questions and Answers

This article presents nine frequently asked Python interview questions covering lists, tuples, dictionaries, string reversal, memory management, session/cookie/token concepts, HTTP methods, decorators, concurrency, comprehensions, and generators, each explained with clear descriptions and code examples for developers preparing for technical interviews.

Data StructuresGeneratorsMemory Management
0 likes · 11 min read
9 Common Python Interview Questions and Answers
政采云技术
政采云技术
Apr 6, 2020 · Fundamentals

Red-Black Tree Deletion Explained (Part 2)

This article provides a comprehensive, step‑by‑step explanation of red‑black tree deletion, covering node search, replacement strategies, nine deletion cases with detailed rotations and recoloring, accompanying JavaScript code, and real‑world applications in Java, Nginx, and Linux kernels.

AlgorithmsData StructuresDeletion
0 likes · 20 min read
Red-Black Tree Deletion Explained (Part 2)
Full-Stack Internet Architecture
Full-Stack Internet Architecture
Apr 3, 2020 · Databases

Understanding B+ Tree Indexes in MySQL

This article explains why B+ trees are the dominant data structure for MySQL indexes, compares them with hash tables, linked lists, and skip lists, and details page splits, merges, and how index values map to row records, helping readers master high‑frequency interview questions.

B+TreeData StructuresDatabase Index
0 likes · 14 min read
Understanding B+ Tree Indexes in MySQL
Programmer DD
Programmer DD
Mar 28, 2020 · Fundamentals

Master 8 Essential Data Structures Every Programmer Should Know

This article provides a concise overview of eight fundamental data structures—including arrays, linked lists, stacks, queues, hash tables, trees, heaps, and graphs—explaining their definitions, core operations, typical applications, and visual illustrations, helping programmers understand their role in software development and interview preparation.

Data Structuresprogramming
0 likes · 12 min read
Master 8 Essential Data Structures Every Programmer Should Know
Java Backend Technology
Java Backend Technology
Mar 28, 2020 · Backend Development

How Bloom Filters Eliminate Cache Penetration and Boost Backend Performance

This article explains why cache penetration occurs in high‑dimensional data scenarios, introduces Bloom Filters as a solution, outlines suitable use cases such as database lookups, cache outages, web request filtering, malicious URL detection and Bitcoin sync, and details practical Redis‑based implementations, advantages, drawbacks, and advanced counting filter techniques.

Data Structuresbloom-filtercache-penetration
0 likes · 13 min read
How Bloom Filters Eliminate Cache Penetration and Boost Backend Performance
Architecture Digest
Architecture Digest
Mar 27, 2020 · Databases

Understanding Redis Memory Model: Objects, Allocation, and Internal Encoding

This article explains Redis's memory model by describing how to query memory usage, the roles of used_memory, used_memory_rss, mem_fragmentation_ratio, and mem_allocator, and then dives into the internal structures such as redisObject, SDS, jemalloc, and the encoding strategies for strings, lists, hashes, sets, and sorted sets.

Data StructuresMemory ManagementSDS
0 likes · 28 min read
Understanding Redis Memory Model: Objects, Allocation, and Internal Encoding
ITPUB
ITPUB
Mar 25, 2020 · Fundamentals

Essential Data Structures Every Programmer Should Master

This article introduces eight fundamental data structures—arrays, linked lists, stacks, queues, hash tables, trees, heaps, and graphs—explaining their definitions, core operations, typical applications, and key characteristics to help developers build a solid foundation.

ArrayData StructuresQueue
0 likes · 13 min read
Essential Data Structures Every Programmer Should Master
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 InternalsSDS
0 likes · 12 min read
Inside Redis: A Deep Dive into Its Core Data Structures
ITFLY8 Architecture Home
ITFLY8 Architecture Home
Mar 8, 2020 · Fundamentals

Why Java’s HashMap Combines Arrays, Linked Lists, and Red‑Black Trees

This article explains the fundamentals of hash tables, compares their performance with arrays, linked lists, and binary trees, describes how Java's HashMap handles collisions using chaining and treeification, and details the evolution from JDK 7 to JDK 8, including the design of ConcurrentHashMap for thread safety.

ConcurrentHashMapData StructuresHashMap
0 likes · 23 min read
Why Java’s HashMap Combines Arrays, Linked Lists, and Red‑Black Trees
ITFLY8 Architecture Home
ITFLY8 Architecture Home
Mar 2, 2020 · Databases

Redis Internals Explained: Data Structures, Memory Management & Use Cases

This article explores Redis, a high‑performance in‑memory key‑value store, detailing its core data types—String, List, Hash, Set, ZSet—the underlying structures such as SDS, quicklist, hashtable, and intset, and demonstrates practical usage patterns like caching, rate limiting, and inventory control.

Data StructuresIn-Memory DatabaseMemory Management
0 likes · 16 min read
Redis Internals Explained: Data Structures, Memory Management & Use Cases
Python Programming Learning Circle
Python Programming Learning Circle
Feb 12, 2020 · Fundamentals

9 Common Python Interview Questions and Answers

This article reviews nine frequently asked Python interview questions, covering lists, tuples, dictionaries, string reversal, memory management, sessions, cookies, tokens, GET vs POST, decorators, concurrency concepts, comprehensions, and generators, providing concise explanations and code examples.

Data StructuresGeneratorsMemory Management
0 likes · 11 min read
9 Common Python Interview Questions and Answers
Selected Java Interview Questions
Selected Java Interview Questions
Feb 6, 2020 · Fundamentals

Binary Search Tree (BST) Overview, Implementation, and Traversal in C

This article introduces the concept of trees and binary search trees, defines a C struct for tree nodes, and provides complete implementations for creating nodes, inserting, deleting, searching, finding min/max, computing size and height, as well as recursive and non‑recursive traversals including pre‑order, in‑order, post‑order and level‑order.

Binary Search TreeCData Structures
0 likes · 13 min read
Binary Search Tree (BST) Overview, Implementation, and Traversal in C
Architecture Digest
Architecture Digest
Feb 4, 2020 · Databases

Comprehensive Guide to Redis: Usage, Performance, Data Types, Expiration Strategies, and Common Pitfalls

This article provides an in‑depth overview of Redis, covering why it is used for performance and concurrency, its single‑threaded architecture, core data structures and their scenarios, expiration policies, memory eviction strategies, consistency challenges, and practical solutions for cache penetration, snowballing, and concurrent key updates.

Data StructuresMemory Managementcaching
0 likes · 12 min read
Comprehensive Guide to Redis: Usage, Performance, Data Types, Expiration Strategies, and Common Pitfalls
Liangxu Linux
Liangxu Linux
Dec 24, 2019 · Fundamentals

Master Red-Black Trees: Definitions, Properties, and Insertion/Deletion Walkthrough

This article provides a comprehensive, image‑rich tutorial on red‑black trees, covering their definition, five core properties, node naming conventions, rotation and recoloring operations, detailed search algorithms, step‑by‑step insertion and deletion cases with visual illustrations, and answers to thought‑provoking exercises.

AlgorithmsData StructuresDeletion
0 likes · 25 min read
Master Red-Black Trees: Definitions, Properties, and Insertion/Deletion Walkthrough
政采云技术
政采云技术
Dec 22, 2019 · Fundamentals

A Beginner-Friendly Illustrated Guide to Red-Black Trees (Part 1)

This article provides a clear, illustrated introduction to red‑black trees, covering their definition, fundamental properties, binary search tree background, traversal methods, rotation and recoloring techniques, and detailed insertion scenarios with JavaScript code examples, preparing readers for further study of deletions.

AlgorithmsBinary Search TreeData Structures
0 likes · 19 min read
A Beginner-Friendly Illustrated Guide to Red-Black Trees (Part 1)
Architecture Digest
Architecture Digest
Dec 18, 2019 · Fundamentals

Understanding Red‑Black Trees: Principles, Insertion, Deletion, Rotations and Java TreeMap Implementation

This article provides a comprehensive overview of red‑black trees, covering the underlying concepts of binary trees, binary search trees, balanced trees such as AVL, the five red‑black properties, insertion and deletion algorithms with color changes and rotations, and a detailed Java TreeMap source‑code illustration.

BalancingData StructuresDeletion
0 likes · 23 min read
Understanding Red‑Black Trees: Principles, Insertion, Deletion, Rotations and Java TreeMap Implementation
JD Retail Technology
JD Retail Technology
Dec 9, 2019 · Databases

Memory Optimization in Redis Using zipList and Hash Bucketing

This article explains how to dramatically reduce Redis memory consumption—by up to 90%—through converting long string keys to integers, leveraging zipList‑encoded hashes, and distributing millions of key‑value pairs across many hash buckets while maintaining query performance.

Data StructuresHashMemory Optimization
0 likes · 11 min read
Memory Optimization in Redis Using zipList and Hash Bucketing
Ops Development Stories
Ops Development Stories
Dec 6, 2019 · Databases

Master Redis: Installation, Commands, and Persistence Explained

An in‑depth guide covering Redis fundamentals, installation steps, daemon configuration, password setup, core commands for strings, lists, hashes, sets and sorted sets, internal encodings, and both RDB and AOF persistence mechanisms, complete with practical code examples and configuration snippets.

Data StructuresInstallationPersistence
0 likes · 38 min read
Master Redis: Installation, Commands, and Persistence Explained
ITPUB
ITPUB
Dec 5, 2019 · Fundamentals

Master Python Lists: Essential Operations and Practical Examples

This tutorial introduces Python lists, explaining their characteristics, how to create them, and covering the most common operations such as indexing, slicing, concatenation, repetition, membership testing, built‑in functions, and list methods with clear code examples.

Data StructuresListPython
0 likes · 6 min read
Master Python Lists: Essential Operations and Practical Examples
Selected Java Interview Questions
Selected Java Interview Questions
Dec 4, 2019 · Fundamentals

Understanding Java HashMap: Implementation Principles, JDK7 Source Walkthrough, and Interview Insights

This article explains the fundamentals of hash tables, dives deep into Java's HashMap implementation—including JDK7 source code analysis of its internal structures, resizing logic, and key methods—while also covering common interview questions such as why the array size must be a power of two and the necessity of overriding both equals and hashCode.

Data StructuresHashMapJDK7
0 likes · 19 min read
Understanding Java HashMap: Implementation Principles, JDK7 Source Walkthrough, and Interview Insights
Java Backend Technology
Java Backend Technology
Nov 23, 2019 · Backend Development

Master Java Backend Interview Questions: Sets, HashMaps, Concurrency, and More

This article compiles essential Java backend interview topics, covering the differences between TreeSet and HashSet, HashMap collision handling and resizing, ConcurrentHashMap's lock strategy, thread pool creation, synchronization primitives like CountDownLatch and CyclicBarrier, database indexing, CAP theorem, idempotence, locking mechanisms, JVM GC roots, reflection, dynamic proxies, distributed locks, ThreadLocal optimization, and key considerations for designing a high‑traffic seckill system.

BackendData StructuresJava
0 likes · 14 min read
Master Java Backend Interview Questions: Sets, HashMaps, Concurrency, and More
MaGe Linux Operations
MaGe Linux Operations
Nov 21, 2019 · Backend Development

Surviving a ByteDance Interview: Nginx, Redis, and Data‑Structure Lessons

The author recounts a grueling ByteDance video interview, detailing technical questions on Django deployment, Nginx configuration, uWSGI internals, Redis fundamentals, heap data structures and quick‑sort coding, while sharing hard‑earned career advice for developers preparing for high‑stakes interviews.

BackendData StructuresNginx
0 likes · 12 min read
Surviving a ByteDance Interview: Nginx, Redis, and Data‑Structure Lessons
Selected Java Interview Questions
Selected Java Interview Questions
Nov 11, 2019 · Fundamentals

Performance Comparison of Java ArrayList and LinkedList

This article explains the differences between Java's ArrayList and LinkedList, detailing their internal implementations, performance characteristics for adding, inserting, deleting, and iterating elements, and provides code examples and benchmark results to guide when to choose each collection.

ArrayListData StructuresJava
0 likes · 11 min read
Performance Comparison of Java ArrayList and LinkedList
Big Data Technology & Architecture
Big Data Technology & Architecture
Nov 6, 2019 · Databases

Understanding Hash Functions, Hash Tables, and Their Implementation in Redis

This article explains the concept of hash functions and hash tables, illustrates how they map data to array indices, discusses collision resolution methods, and details Redis's internal dictionary implementation, including zipmap optimization, operation complexities, and practical usage differences between hashes and sets.

Data StructuresHashMemory Optimization
0 likes · 8 min read
Understanding Hash Functions, Hash Tables, and Their Implementation in Redis
Full-Stack Internet Architecture
Full-Stack Internet Architecture
Oct 20, 2019 · Fundamentals

Understanding the Differences Between TreeSet, HashSet, HashMap, TreeMap, and Red-Black Trees in Java

An interview-style dialogue explains the distinctions between TreeSet and HashSet, the underlying implementations of HashMap versus TreeMap, and how red‑black trees provide balanced performance, covering hash collisions, treeification, and thread‑safety considerations in Java collections.

CollectionsData StructuresHashMap
0 likes · 6 min read
Understanding the Differences Between TreeSet, HashSet, HashMap, TreeMap, and Red-Black Trees in Java
Python Programming Learning Circle
Python Programming Learning Circle
Oct 11, 2019 · Fundamentals

How to Drastically Reduce Python Object Memory Usage

This article explains why large numbers of active Python objects can cause memory problems and presents several techniques—including using dicts, class __slots__, namedtuple, recordclass, Cython, and NumPy—to shrink object size and dramatically lower memory consumption.

Data StructuresMemory OptimizationPython
0 likes · 11 min read
How to Drastically Reduce Python Object Memory Usage