BestHub
Sign in
Tagged articles

B+Tree

222 articles · Page 1 of 3
Java Tech Workshop
Java Tech Workshop
Aug 18, 2026 · Backend Development

Beyond Adding Indexes: From Disk Pages to B+Tree – Master MySQL Index Design and Operation

This article explains why indexes speed up queries by reducing disk I/O, dives into MySQL's page structure and B+Tree evolution, compares clustered and secondary indexes, clarifies composite index rules, lists common index‑misuse scenarios, and provides seven practical guidelines for designing efficient MySQL indexes.

B+TreeClustered IndexComposite Index
0 likes · 20 min read
Beyond Adding Indexes: From Disk Pages to B+Tree – Master MySQL Index Design and Operation
YiSu Grain
YiSu Grain
Jul 7, 2026 · Databases

Why Databases Skip the First Page: How Indexes Speed Up Queries

The article explains how database indexes act like a book's table of contents, reducing full‑table scans and disk I/O by using B+Tree structures, and compares clustered, non‑clustered, and covering indexes while highlighting their benefits and trade‑offs.

B+TreeClustered IndexCovering Index
0 likes · 11 min read
Why Databases Skip the First Page: How Indexes Speed Up Queries
samdeepthink
samdeepthink
Jul 3, 2026 · Databases

MySQL Index Interview Guide: From B+ Trees to Index Design

This article explains MySQL index fundamentals—from the B+‑tree storage engine and InnoDB’s clustered and secondary indexes to query execution, common index‑failure scenarios, and practical design principles for building effective indexes in interview settings.

B+TreeEXPLAINIndex
0 likes · 25 min read
MySQL Index Interview Guide: From B+ Trees to Index Design
Code Farming
Code Farming
Jun 24, 2026 · Databases

MySQL Indexes: Master B+Tree Fundamentals to Nail Interview Questions

The article breaks down MySQL index mechanics into four visual sections, explaining B+Tree structure, why it outperforms B‑tree, hash and binary trees, common index‑failure scenarios, and three practical optimization techniques, giving interviewees a clear framework to answer index‑related questions confidently.

B+TreeDatabase PerformanceMySQL
0 likes · 7 min read
MySQL Indexes: Master B+Tree Fundamentals to Nail Interview Questions
Architecture & Thinking
Architecture & Thinking
Apr 24, 2026 · Databases

SQL Index Failure Scenarios: Essential Pitfalls and Fixes Every Developer Must Know

This article systematically examines why MySQL indexes can become ineffective—covering function calls, implicit casts, LIKE patterns, OR conditions, composite‑index left‑most rules, data distribution, and ORDER/GROUP mismatches—while providing concrete code examples, production case studies, and actionable optimization techniques.

B+TreeMySQLQuery Planning
0 likes · 26 min read
SQL Index Failure Scenarios: Essential Pitfalls and Fixes Every Developer Must Know
dbaplus Community
dbaplus Community
Apr 19, 2026 · Databases

Why Vector Databases Exist: Overcoming SQL’s Blind Spot in AI Search

This guide explains how traditional relational databases and SQL struggle with semantic queries needed for AI applications, introduces vector databases and HNSW indexing for efficient similarity search, compares their architectures, and presents a real‑world fraud detection system that combines both technologies.

AIB+TreeHNSW
0 likes · 17 min read
Why Vector Databases Exist: Overcoming SQL’s Blind Spot in AI Search
Architect's Guide
Architect's Guide
Apr 3, 2026 · Databases

How to Diagnose and Solve MySQL Table Size Bottlenecks

This article explains how to assess MySQL table size using table capacity, disk usage, and instance limits, reveals why large tables slow down due to B+‑tree overhead, and presents three practical solutions—partitioning, sharding, and hot‑cold archiving—to restore query performance.

B+TreeHot Cold ArchivingMySQL
0 likes · 17 min read
How to Diagnose and Solve MySQL Table Size Bottlenecks
Senior Xiao Ying
Senior Xiao Ying
Feb 13, 2026 · Databases

Master MySQL Indexes: Deep Dive into B+ Tree Structure and Optimization Strategies

This guide explains MySQL’s B+‑tree index architecture, compares clustered and secondary indexes, demonstrates covering and prefix indexes, outlines design principles such as high‑selectivity columns and the left‑most prefix rule, and shows how to use EXPLAIN and real‑world examples to diagnose and improve query performance.

B+TreeClustered IndexCovering Index
0 likes · 12 min read
Master MySQL Indexes: Deep Dive into B+ Tree Structure and Optimization Strategies
Architect's Guide
Architect's Guide
Feb 13, 2026 · Fundamentals

Unlocking Fast Disk Indexing: How B‑Trees, B+‑Trees & R‑Trees Work

This article explains why multi‑way search trees such as B‑trees, B+‑trees, B*‑trees and R‑trees are crucial for reducing disk I/O in large‑scale storage systems, covering their hardware background, structural definitions, height analysis, insertion and deletion algorithms, and practical examples with code and diagrams.

B+TreeB-treeData Structures
0 likes · 51 min read
Unlocking Fast Disk Indexing: How B‑Trees, B+‑Trees & R‑Trees Work
Ray's Galactic Tech
Ray's Galactic Tech
Jan 14, 2026 · Databases

Why MySQL’s B+Tree Indexes Power High‑Performance Queries

This article explains how MySQL implements indexes with B+Tree structures, why they outperform full table scans, the internal layout of leaf and internal nodes, insertion and split mechanics, range‑query processing, and practical optimization tips for clustered and secondary indexes.

B+TreeDatabaseIndex
0 likes · 11 min read
Why MySQL’s B+Tree Indexes Power High‑Performance Queries
Su San Talks Tech
Su San Talks Tech
Nov 26, 2025 · Databases

Master Database Indexes: 10 Essential Questions and Best Practices

This guide explores the fundamentals of database indexing, answering ten common questions about index design, performance pitfalls, composite indexes, covering indexes, NULL handling, and maintenance, while providing practical SQL examples, B+‑tree concepts, and best‑practice recommendations for MySQL and PostgreSQL.

B+TreeIndexingMySQL
0 likes · 13 min read
Master Database Indexes: 10 Essential Questions and Best Practices
Programmer1970
Programmer1970
Nov 21, 2025 · Databases

10 Core MySQL InnoDB Interview Questions Explained

This article walks through ten essential MySQL InnoDB interview questions, covering why InnoDB uses B+ trees, MVCC isolation levels, two‑phase commit, gap locks, buffer‑pool LRU design, undo‑log mechanics, binlog formats, lock‑upgrade behavior, double‑write buffering, and the differences between clustered and non‑clustered indexes.

2PCB+TreeBinlog Formats
0 likes · 17 min read
10 Core MySQL InnoDB Interview Questions Explained
DaTaobao Tech
DaTaobao Tech
Nov 19, 2025 · Databases

Mastering MySQL Slow Query Diagnosis and Index Optimization

This article walks through a real‑world slow‑SQL case on a massive e‑commerce order table, explains B+Tree index structures, index height estimation, index push‑down, sorting strategies, EXPLAIN and Query Profiler usage, and provides a step‑by‑step SOP for safe index changes and validation.

B+TreeMySQLQuery Profiling
0 likes · 40 min read
Mastering MySQL Slow Query Diagnosis and Index Optimization
Architect's Guide
Architect's Guide
Nov 8, 2025 · Databases

Mastering MySQL Indexes: From Hash Tables to B+ Trees Explained

This article explains the fundamentals of database indexing, covering what indexes are, their advantages and drawbacks, underlying structures such as hash tables, B‑tree and B+‑tree, different index types (clustered, non‑clustered, primary, secondary) in MySQL, and practical examples with code snippets.

B+TreeClustered IndexDatabase Indexes
0 likes · 9 min read
Mastering MySQL Indexes: From Hash Tables to B+ Trees Explained
Architect's Must-Have
Architect's Must-Have
Nov 2, 2025 · Databases

Master MySQL Indexes: From Basics to B+Tree Optimization

This article explains MySQL indexes—how they speed up queries, their types, the inner workings of B‑Tree and B+Tree structures, page storage mechanics, and the trade‑offs between clustered and secondary indexes, providing practical insights for database optimization.

B+TreeIndexInnoDB
0 likes · 11 min read
Master MySQL Indexes: From Basics to B+Tree Optimization
IT Services Circle
IT Services Circle
Oct 3, 2025 · Databases

Why Does PostgreSQL’s B‑Tree Index Behave Like a B+ Tree?

PostgreSQL’s index system, officially called a B‑Tree, actually implements B+‑tree functionality, storing only TIDs in leaf nodes, using linked leaf pages for efficient range queries, and includes optimizations like deduplication, index‑only scans, and reverse‑key indexes to boost performance.

B+TreeB-TreePostgreSQL
0 likes · 7 min read
Why Does PostgreSQL’s B‑Tree Index Behave Like a B+ Tree?
dbaplus Community
dbaplus Community
Sep 22, 2025 · Databases

Why MySQL Tables Shouldn’t Exceed 10 Million Rows – A Deep Dive into InnoDB Pages & B+Tree Limits

This article explains why the industry advises keeping MySQL single‑table row counts below ten million by examining InnoDB’s 16KB page structure, B+‑tree indexing mechanics, fan‑out calculations, and how page size and row size together determine the practical limits and performance cliffs of large tables.

B+TreeDatabaseDesignIndexing
0 likes · 20 min read
Why MySQL Tables Shouldn’t Exceed 10 Million Rows – A Deep Dive into InnoDB Pages & B+Tree Limits
DeWu Technology
DeWu Technology
Sep 15, 2025 · Databases

Why MySQL Single-Table Data Should Stay Under 20 Million Rows

This article explains how InnoDB stores data in 16 KB pages, how B+Tree indexes work, derives the formula for the maximum number of rows a single MySQL table can hold, and why the practical limit of about twenty million rows exists, along with performance implications and optimization tips.

B+TreeInnoDBMySQL
0 likes · 20 min read
Why MySQL Single-Table Data Should Stay Under 20 Million Rows
Data Party THU
Data Party THU
Aug 26, 2025 · Fundamentals

Beyond the Basics: 5 Advanced Data Structures That Power Modern Systems

This article explores five sophisticated data structures—B‑Tree, Radix Tree, Rope, Bloom Filter, and Cuckoo Hash—explaining their design, typical use cases, and why they outperform classic structures when handling massive scale, high‑speed lookups, or complex data manipulation.

B+TreeBloom filterCuckoo Hash
0 likes · 11 min read
Beyond the Basics: 5 Advanced Data Structures That Power Modern Systems
Deepin Linux
Deepin Linux
Jul 6, 2025 · Fundamentals

Unlocking ext4 Extents: How Linux Filesystems Boost Performance

This article explores the evolution, design, and inner workings of the ext4 extent mechanism in Linux, detailing how it replaces traditional block mapping, improves storage efficiency, reduces fragmentation, and accelerates file I/O through compact data structures and B+‑tree indexing.

B+TreeExtentLinux
0 likes · 18 min read
Unlocking ext4 Extents: How Linux Filesystems Boost Performance
macrozheng
macrozheng
Jul 4, 2025 · Databases

How Many Rows Can a MySQL Table Really Hold? A Deep Dive into B+ Tree Limits

This article consolidates theory and practical calculations to reveal how MySQL's B+‑tree storage, page structure, and row size determine the realistic maximum number of records a single table can store, ranging from millions to billions depending on schema choices.

B+TreeDatabase LimitsIndex Calculation
0 likes · 11 min read
How Many Rows Can a MySQL Table Really Hold? A Deep Dive into B+ Tree Limits
Architect's Must-Have
Architect's Must-Have
Jul 2, 2025 · Databases

Why MySQL Indexes Matter: From Basics to B+Tree Mastery

This article explains what MySQL indexes are, how they work, their advantages and drawbacks, the different index types, the inner workings of B+Tree structures, and the differences between clustered and non‑clustered indexes, providing practical insights for database optimization.

B+TreeClustered IndexIndex
0 likes · 10 min read
Why MySQL Indexes Matter: From Basics to B+Tree Mastery
Code Ape Tech Column
Code Ape Tech Column
May 28, 2025 · Databases

Evaluating MySQL Table Size and Optimizing Large Tables with Partitioning, Sharding, and Hot‑Cold Archiving

This article explains how to assess MySQL table size from table capacity, disk usage, and instance limits, describes why large tables degrade performance due to B+‑tree depth, and presents three practical solutions—partitioning, sharding, and hot‑cold archiving—to improve query speed and manage growth.

B+TreeHot Cold ArchivingMySQL
0 likes · 16 min read
Evaluating MySQL Table Size and Optimizing Large Tables with Partitioning, Sharding, and Hot‑Cold Archiving
Architect's Guide
Architect's Guide
Apr 23, 2025 · Databases

Understanding MySQL Indexes: Types, B+Tree Structure, and Clustered vs. Non‑Clustered Indexes

This article explains MySQL indexes, their purpose and working principle, compares primary, ordinary, composite and full‑text indexes, describes the B+Tree storage structure versus B‑Tree, and clarifies the differences between clustered and non‑clustered (auxiliary) indexes along with their advantages and drawbacks.

B+TreeClustered IndexMySQL
0 likes · 10 min read
Understanding MySQL Indexes: Types, B+Tree Structure, and Clustered vs. Non‑Clustered Indexes
21CTO
21CTO
Apr 20, 2025 · Databases

Choosing the Right Database: B‑Tree vs LSM‑Tree – A Story‑Driven Deep Dive

This article walks you through the inner workings of modern databases—explaining storage engines, query parsing, execution, and transaction models—while comparing classic B‑Tree structures with newer LSM‑Tree designs to help you decide whether SQL or NoSQL best fits your performance and consistency needs.

B+TreeDatabasesLSM Tree
0 likes · 8 min read
Choosing the Right Database: B‑Tree vs LSM‑Tree – A Story‑Driven Deep Dive
Deepin Linux
Deepin Linux
Feb 7, 2025 · Fundamentals

Understanding ext4 Extent: Data Structures and B+‑Tree Mechanism

This article explains the purpose, design, and internal data structures of ext4 extents, describes how the B+‑tree indexes extents for efficient mapping of logical to physical blocks, and compares ext4’s extent mechanism with older file‑system addressing methods and other modern file systems.

B+TreeData StructuresExtent
0 likes · 37 min read
Understanding ext4 Extent: Data Structures and B+‑Tree Mechanism
Raymond Ops
Raymond Ops
Feb 1, 2025 · Databases

Why MySQL Chooses B+ Trees: From BSTs to Efficient Disk Indexes

This article explains how MySQL's indexing evolved from simple binary search trees through AVL and red‑black trees to B‑trees and finally B+ trees, highlighting the performance and I/O advantages that make B+ trees the preferred index structure for disk‑based databases.

B+TreeData StructuresDatabase Performance
0 likes · 13 min read
Why MySQL Chooses B+ Trees: From BSTs to Efficient Disk Indexes
Alibaba Cloud Developer
Alibaba Cloud Developer
Jan 14, 2025 · Databases

Mastering MySQL Indexes: From Hash Tables to B+ Trees and Optimization Tips

This article explains the concept of database indexes, compares various index structures such as hash tables, ordered arrays, binary trees, B‑trees and B+‑trees, details InnoDB primary, secondary, covering and composite indexes, discusses prefix indexes and order‑by optimization, and provides practical advice and SQL examples for improving MySQL query performance.

B+TreeIndexingMySQL
0 likes · 18 min read
Mastering MySQL Indexes: From Hash Tables to B+ Trees and Optimization Tips
ITPUB
ITPUB
Oct 28, 2024 · Databases

Why a MySQL Table Can Hold 100 Million Rows Without Slowing Down

This article explains how MySQL single‑table row limits are determined by primary‑key size, InnoDB page structure, and B+‑tree fan‑out, showing that a table with 100 million rows can still query quickly when the index depth remains low.

B+TreeIndexMySQL
0 likes · 14 min read
Why a MySQL Table Can Hold 100 Million Rows Without Slowing Down
Architecture Digest
Architecture Digest
Sep 23, 2024 · Databases

Evaluating and Optimizing Large MySQL Tables: Partitioning, Sharding, and Hot‑Cold Archiving Strategies

This article explains how to assess MySQL table size using table capacity, disk usage, and instance resources, describes why large tables degrade performance, and presents three practical solutions—partitioning, sharding (horizontal/vertical), and hot‑cold data archiving—along with their trade‑offs and implementation tips.

B+TreeHotColdArchivingMySQL
0 likes · 15 min read
Evaluating and Optimizing Large MySQL Tables: Partitioning, Sharding, and Hot‑Cold Archiving Strategies
JD Tech
JD Tech
Aug 19, 2024 · Databases

Understanding MySQL Indexes: Models, Maintenance, Utilization, and Optimization

This article explains MySQL index fundamentals—including hash tables, ordered arrays, and B+‑tree structures—covers index maintenance, demonstrates how indexes improve query execution, discusses best practices such as left‑most prefix, covering indexes, index push‑down, and unique indexes, and provides practical tips for index selection, avoiding index loss, and using EXPLAIN for performance tuning.

B+TreeIndexSQL
0 likes · 17 min read
Understanding MySQL Indexes: Models, Maintenance, Utilization, and Optimization
MaGe Linux Operations
MaGe Linux Operations
May 5, 2024 · Databases

Why MySQL Chooses B+ Trees: From BSTs to High-Performance Indexes

This article traces the evolution of tree‑based index structures—from simple binary search trees through AVL and red‑black trees to B‑trees and B+‑trees—explaining their strengths and limitations and why MySQL adopts B+‑trees to minimize disk I/O and boost query performance.

B+TreeData StructuresDatabase Performance
0 likes · 12 min read
Why MySQL Chooses B+ Trees: From BSTs to High-Performance Indexes
Aikesheng Open Source Community
Aikesheng Open Source Community
Apr 28, 2024 · Databases

Database Indexing Algorithms: B‑Tree vs Hash Indexing

This article explains the purpose and inner workings of various database indexing algorithms—including B‑Tree, Hash, Bitmap, and Full‑Text indexes—illustrates their strengths and weaknesses with SQL examples, and provides guidance on when to choose each type for optimal query performance.

B+TreeBitmap IndexFull-text Search
0 likes · 12 min read
Database Indexing Algorithms: B‑Tree vs Hash Indexing
Liangxu Linux
Liangxu Linux
Apr 25, 2024 · Databases

How MySQL’s B+ Tree Indexes Supercharge Query Speed and Reliability

MySQL, born in the 1990s as a free open‑source database, became a core component of the LAMP stack and remains widely used; the article explains why indexes are needed, compares binary trees, B‑trees and B+‑trees, and describes how modern cloud‑based MySQL services improve performance and reliability.

B+TreeData StructuresMySQL
0 likes · 9 min read
How MySQL’s B+ Tree Indexes Supercharge Query Speed and Reliability
Su San Talks Tech
Su San Talks Tech
Feb 25, 2024 · Databases

Why MySQL Indexes Fail: B+ Tree Mechanics and Common Pitfalls

This article explains how InnoDB stores data pages and builds B+‑tree indexes, illustrates the structure of clustered, secondary and composite indexes, and enumerates typical scenarios—such as left‑most prefix violations, LIKE patterns, and function use—that cause index loss and full‑table scans.

B+TreeDatabaseIndex
0 likes · 16 min read
Why MySQL Indexes Fail: B+ Tree Mechanics and Common Pitfalls
政采云技术
政采云技术
Jan 2, 2024 · Databases

Understanding B‑Tree and B+Tree Indexes in MySQL

This article explains the fundamentals of B‑Tree and B+Tree data structures, their search algorithms, and how MySQL's MyISAM and InnoDB storage engines implement these indexes to achieve efficient disk‑based query performance.

AlgorithmsB+TreeB-Tree
0 likes · 19 min read
Understanding B‑Tree and B+Tree Indexes in MySQL
LouZai
LouZai
Dec 18, 2023 · Databases

How Many Rows Can a Single MySQL Table Actually Store? A Deep Dive

This article analyzes the theoretical and practical limits of a single MySQL InnoDB table by examining B+‑tree depth, page layout, row format, and index pointer size, then calculates minimum and maximum record counts for int and bigint primary keys and validates the results with real‑world table schemas.

B+TreeIndex PointerInnoDB
0 likes · 13 min read
How Many Rows Can a Single MySQL Table Actually Store? A Deep Dive
Java High-Performance Architecture
Java High-Performance Architecture
Nov 2, 2023 · Databases

How to Tackle Large MySQL Tables: Partitioning, Sharding, and Archiving Strategies

When MySQL tables grow to millions of rows, insert and query latency increase, schema changes become costly, and irrelevant data bloats storage, so this guide evaluates table size, explains why B+‑tree depth hurts performance, and presents partitioning, sharding, and hot‑cold archiving solutions with practical SQL examples.

B+TreeMySQLSharding
0 likes · 15 min read
How to Tackle Large MySQL Tables: Partitioning, Sharding, and Archiving Strategies
Efficient Ops
Efficient Ops
Nov 1, 2023 · Databases

Why MySQL Single Tables Should Stay Below 20 Million Rows: Theory & Practice

This article explains the technical reasons why a MySQL single table should not exceed about 20 million rows, covering limits from auto‑increment primary keys, data‑page structures, B+‑tree storage calculations, and practical partitioning recommendations for large‑scale applications.

B+TreeMySQLTable Size Limits
0 likes · 9 min read
Why MySQL Single Tables Should Stay Below 20 Million Rows: Theory & Practice
ITPUB
ITPUB
Sep 18, 2023 · Databases

Why Keep a MySQL Table Under 20 Million Rows? Primary Key & Data Page Insights

This article explains why a single MySQL table should stay below about twenty million rows by examining primary‑key limits, InnoDB data‑page structure, B+‑tree storage calculations, and provides a practical recommendation based on row size and fragmentation.

B+TreeData PageDatabase Design
0 likes · 9 min read
Why Keep a MySQL Table Under 20 Million Rows? Primary Key & Data Page Insights
dbaplus Community
dbaplus Community
Jul 30, 2023 · Databases

Why a MySQL Table Can Hold 100 Million Rows Without Slowing Down

This article explains the myth of a 2 million‑row limit for MySQL tables, shows how primary‑key size and InnoDB page structure determine theoretical row limits, details B+‑tree indexing mechanics, calculates practical capacities, and compares B+‑tree with B‑tree performance.

B+TreeInnoDBMySQL
0 likes · 14 min read
Why a MySQL Table Can Hold 100 Million Rows Without Slowing Down
Tongcheng Travel Technology Center
Tongcheng Travel Technology Center
Jul 19, 2023 · Databases

InnoDB Storage Model Overview and Internal Structures

This article explains how InnoDB stores data on disk, describing tablespaces, segments, extents, pages, row formats, record headers, page directories, B+‑tree indexes, and the differences between clustered and secondary indexes, with examples and diagrams to illustrate each component.

B+TreeIndexInnoDB
0 likes · 26 min read
InnoDB Storage Model Overview and Internal Structures
Su San Talks Tech
Su San Talks Tech
Jun 12, 2023 · Databases

Master MySQL Indexes: From B+ Trees to Index Merge and Optimization

This article explains MySQL InnoDB index fundamentals, covering index types, data structures, clustered and secondary indexes, covering indexes, index pushdown, index merge, cost‑based index selection, common index‑inefficiency scenarios, and practical guidelines for designing effective indexes.

B+TreeIndexInnoDB
0 likes · 31 min read
Master MySQL Indexes: From B+ Trees to Index Merge and Optimization
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+TreeDatabaseIndexing
0 likes · 13 min read
Why MySQL Chooses B+ Trees Over Skip Lists for Indexing
Su San Talks Tech
Su San Talks Tech
May 30, 2023 · Databases

Master MySQL Indexes: From B+ Trees to Index Merge and Optimization

This article explains MySQL index fundamentals—including classification, B+‑tree and hash structures, clustered and secondary indexes, single‑ and composite‑column indexes, covering indexes, index condition pushdown, index merge strategies, cost‑based index selection, common index‑invalidating scenarios, and practical guidelines for creating effective indexes.

B+TreeDatabase PerformanceIndex
0 likes · 29 min read
Master MySQL Indexes: From B+ Trees to Index Merge and Optimization
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+TreeDatabaseIndexing
0 likes · 12 min read
Why MySQL Uses B+ Trees Instead of Skip Lists for Indexing
Sanyou's Java Diary
Sanyou's Java Diary
May 23, 2023 · Databases

Master MySQL Indexes: From B+ Trees to Index Merge and Optimization

This article provides a comprehensive guide to MySQL indexing, covering index types, data structures, clustering vs. non‑clustering, hash and B+Tree indexes, covering indexes, index push‑down, index merge strategies, cost‑based index selection, common pitfalls, and practical indexing principles with illustrative examples and SQL snippets.

B+TreeDatabaseIndex
0 likes · 31 min read
Master MySQL Indexes: From B+ Trees to Index Merge and Optimization
dbaplus Community
dbaplus Community
May 7, 2023 · Databases

Mastering MySQL Indexes: 15 Essential Q&A to Boost Query Performance

This article provides a comprehensive 15‑question guide on MySQL indexes, covering their definition, various types across data‑structure, physical and logical dimensions, situations where indexes fail or are unsuitable, B+‑tree advantages, search process, covering indexes, left‑most prefix, index push‑down, adding indexes to huge tables, using EXPLAIN to verify index usage, hash versus B+‑tree differences, pros and cons, and the distinction between clustered and non‑clustered indexes.

B+TreeIndexMySQL
0 likes · 18 min read
Mastering MySQL Indexes: 15 Essential Q&A to Boost Query Performance
Shepherd Advanced Notes
Shepherd Advanced Notes
Mar 27, 2023 · Databases

Why MySQL Uses B+ Trees for Indexing

The article explains the fundamentals of tree data structures, compares B, B+, B*, and red‑black trees, and shows how B+ trees reduce disk I/O and improve range query performance, which is why MySQL adopts B+ trees for its indexes.

B+TreeData StructuresDisk I/O
0 likes · 15 min read
Why MySQL Uses B+ Trees for Indexing
Shepherd Advanced Notes
Shepherd Advanced Notes
Mar 22, 2023 · Databases

Mastering MySQL Indexes: Advanced Concepts and Practical Tips

This article provides a comprehensive deep‑dive into MySQL indexing, covering the definition, pros and cons, differences between clustered and non‑clustered indexes, InnoDB vs MyISAM implementations, B+Tree structure, capacity calculations, adaptive hash indexes, index pushdown optimization, and how to interpret EXPLAIN output to verify index usage.

Adaptive Hash IndexB+TreeClustered Index
0 likes · 18 min read
Mastering MySQL Indexes: Advanced Concepts and Practical Tips
Liangxu Linux
Liangxu Linux
Feb 18, 2023 · Databases

Why Does One MySQL UPDATE Block While Another Doesn’t? Deep Dive into InnoDB Locks

The article explains why an UPDATE on the same row in MySQL can block in one transaction but not in another, by analyzing the types of row‑level locks (record, next‑key, gap) acquired during SELECT … FOR UPDATE, normal updates, and updates that modify primary‑key values, illustrating the lock behavior with B+‑tree examples.

B+TreeInnoDBMySQL
0 likes · 8 min read
Why Does One MySQL UPDATE Block While Another Doesn’t? Deep Dive into InnoDB Locks
ITPUB
ITPUB
Feb 9, 2023 · Databases

Inside InnoDB: How MySQL Stores Data, Row Formats, and Indexes Explained

This article breaks down MySQL's InnoDB storage engine, detailing where data files reside, the different row formats (compact, redundant, dynamic, compressed), the internal 16 KB page layout, record header fields, overflow handling, and how B‑tree indexes (clustered and secondary) are built and searched.

B+TreeDatabase StorageIndexing
0 likes · 24 min read
Inside InnoDB: How MySQL Stores Data, Row Formats, and Indexes Explained
ITPUB
ITPUB
Feb 8, 2023 · Databases

Why Does One MySQL UPDATE Block While Another Doesn’t? A Deep Dive into Row‑Level Locks

This article explains why an UPDATE on a MySQL row that changes a regular column proceeds without blocking, while an UPDATE that modifies the primary‑key value gets blocked, by analyzing the locks set by preceding transactions, the B+‑tree index structure, and the delete‑plus‑insert rewrite performed by InnoDB.

B+TreeGap LockMySQL
0 likes · 9 min read
Why Does One MySQL UPDATE Block While Another Doesn’t? A Deep Dive into Row‑Level Locks
NiuNiu MaTe
NiuNiu MaTe
Dec 21, 2022 · Databases

Why Is MySQL OFFSET Slow? B+ Tree Index Insights & K‑th Largest Query Optimization

This article examines how MySQL uses secondary indexes to find the K‑th largest value, analyzes the O(N) time complexity caused by offset pagination, explains the underlying B+‑tree double‑linked list behavior, and presents three optimization strategies—including index covering, pagination redesign, and boundary prediction—to dramatically improve performance.

B+TreeMySQLindex optimization
0 likes · 10 min read
Why Is MySQL OFFSET Slow? B+ Tree Index Insights & K‑th Largest Query Optimization