BestHub
Sign in
Tagged articles
210 articles
Page 2 of 3
Architecture & Thinking
Architecture & Thinking
Apr 14, 2022 · Databases

Mastering MySQL Indexes: Boost Query Performance with B‑Tree, Prefix, and Composite Strategies

This article explains how MySQL stores indexes using B+ trees, how to evaluate index selectivity and prefix length, the importance of the leftmost principle for composite indexes, and practical techniques such as covering indexes, index condition pushdown, and avoiding common pitfalls that render indexes ineffective, all illustrated with real‑world query examples and performance measurements.

B+TreeDatabase Performancemysql
0 likes · 36 min read
Mastering MySQL Indexes: Boost Query Performance with B‑Tree, Prefix, and Composite Strategies
Architecture & Thinking
Architecture & Thinking
Apr 11, 2022 · Databases

Unlocking MySQL Indexes: How B+ Trees Boost Query Performance

This article explains how MySQL implements indexes using B+ trees in InnoDB and MyISAM, compares primary and secondary indexes, demonstrates performance gains from proper indexing on large tables, and provides practical commands for creating, viewing, and dropping indexes.

B+Treemysqlperformance
0 likes · 12 min read
Unlocking MySQL Indexes: How B+ Trees Boost Query Performance
Java Interview Crash Guide
Java Interview Crash Guide
Apr 1, 2022 · Databases

Why MySQL Uses B+ Trees Over B Trees: Deep Dive into Index Structures

Explore MySQL's comprehensive index guide, covering basic concepts, B‑tree and B+‑tree structures, storage engine differences, index types, optimization strategies, and practical tips for designing effective primary, secondary, and composite indexes to boost query performance and reduce I/O overhead.

B+TreeDatabase OptimizationInnoDB
0 likes · 35 min read
Why MySQL Uses B+ Trees Over B Trees: Deep Dive into Index Structures
IT Services Circle
IT Services Circle
Feb 24, 2022 · Databases

Understanding InnoDB Data Pages, Index Directories, and B+ Tree Indexing

This article explains how InnoDB stores data in 16 KB pages, links pages via a double‑linked list, uses page directories and primary‑key directories for binary search, and builds B+‑tree index pages to accelerate MySQL queries, covering free space, page splits, and the overall search flow.

B+TreeData PageInnoDB
0 likes · 8 min read
Understanding InnoDB Data Pages, Index Directories, and B+ Tree Indexing
dbaplus Community
dbaplus Community
Feb 10, 2022 · Databases

Why MySQL Delete Doesn’t Free Space and How InnoDB Reclaims It

This article explains why MySQL’s DELETE only sets a delete‑mark, how InnoDB’s MVCC and purge thread reuse freed pages, the impact of B+‑tree storage on I/O, page merge and split mechanisms, and the proper way to rebuild tables to recover space.

B+TreeDatabase StorageDelete Mark
0 likes · 14 min read
Why MySQL Delete Doesn’t Free Space and How InnoDB Reclaims It
Top Architect
Top Architect
Jan 11, 2022 · Databases

Understanding InnoDB Primary‑Key B+Tree Capacity and Height

This article explains how InnoDB stores data in 16 KB pages, calculates how many rows a B+Tree index can hold, shows how to determine the tree height from the page level, and answers why MySQL uses B+Tree rather than other tree structures.

B+TreeDatabase IndexInnoDB
0 likes · 10 min read
Understanding InnoDB Primary‑Key B+Tree Capacity and Height
Top Architect
Top Architect
Nov 9, 2021 · Databases

Understanding MySQL Indexes: Types, Structures, and Usage

This article explains MySQL index fundamentals, classifies indexes by data structure, storage engine, field characteristics and column count, compares B+Tree with B‑Tree, hash and red‑black trees, and demonstrates practical creation, usage, and optimization techniques with SQL examples and diagrams.

B+TreeInnoDBindex
0 likes · 14 min read
Understanding MySQL Indexes: Types, Structures, and Usage
NiuNiu MaTe
NiuNiu MaTe
Oct 21, 2021 · Databases

Master MySQL ACID, Isolation Levels, Locks & Indexes – A Deep Dive

This article walks through MySQL's core concepts—including ACID guarantees, the four isolation levels, undo and redo logs, buffer pool flushing, lock types, gap locks, deadlock scenarios, and the B+‑tree based index architecture—providing interview‑ready insights and practical examples.

ACIDB+TreeDatabase Interview
0 likes · 12 min read
Master MySQL ACID, Isolation Levels, Locks & Indexes – A Deep Dive
IT Xianyu
IT Xianyu
Oct 14, 2021 · Databases

Comparing MySQL and HBase: Architecture, Engine, and Application Scenarios

This article compares MySQL and HBase by examining their architectural designs, storage engines, data access patterns, and ecosystem features, highlighting the strengths and trade‑offs of each system and outlining the scenarios where HBase is a suitable complement to MySQL.

B+TreeBig DataHBase
0 likes · 5 min read
Comparing MySQL and HBase: Architecture, Engine, and Application Scenarios
Ops Development Stories
Ops Development Stories
Oct 12, 2021 · Databases

Mastering Database Indexes: From Binary Trees to B+Trees and Beyond

This article explains the fundamentals and structures of database indexes—including binary trees, red‑black trees, B‑Tree, B+Tree, hash indexes—and details how MySQL’s InnoDB and MyISAM engines implement clustered and non‑clustered indexes, covering their characteristics, storage files, and query behavior.

B+TreeDatabase IndexesHash Index
0 likes · 9 min read
Mastering Database Indexes: From Binary Trees to B+Trees and Beyond
IT Architects Alliance
IT Architects Alliance
Oct 4, 2021 · Databases

Understanding MySQL Indexes: Types, Creation, and Optimization

This article explains MySQL indexes, covering their definition, benefits, various types such as B‑tree and B+‑tree, practical techniques for creating high‑performance indexes like prefix, composite, and clustering indexes, and how to inspect and maintain index information and fragmentation.

B+Treeindexmysql
0 likes · 17 min read
Understanding MySQL Indexes: Types, Creation, and Optimization
Programmer DD
Programmer DD
Aug 3, 2021 · Databases

Why MySQL Uses B+ Trees for Indexes and How to Design Effective Indexes

This article explains why MySQL chooses B+ trees for its indexes, covers the left‑most prefix rule for composite indexes, offers practical index‑design tips, discusses MyBatis caching, master‑slave replication, and sharding strategies for large‑scale databases.

B+TreeDatabase OptimizationMyBatis
0 likes · 10 min read
Why MySQL Uses B+ Trees for Indexes and How to Design Effective Indexes
DataFunTalk
DataFunTalk
Jul 20, 2021 · Databases

Time‑Series Database Series: Trends, Design Principles, and Comparative Analysis of OpenTSDB, InfluxDB, and Apache IoTDB

This article explores the evolution and current landscape of time‑series databases, detailing design principles, storage structures such as B‑Tree, B+Tree, and LSM‑Tree, and providing an in‑depth comparison of OpenTSDB, InfluxDB, and the emerging Apache IoTDB, while also discussing practical deployment considerations and industry use cases.

Apache IoTDBB+TreeInfluxDB
0 likes · 38 min read
Time‑Series Database Series: Trends, Design Principles, and Comparative Analysis of OpenTSDB, InfluxDB, and Apache IoTDB
ITPUB
ITPUB
Jun 20, 2021 · Databases

Unveiling MySQL’s Query Execution: From Architecture to Optimization Strategies

This article explains MySQL’s logical architecture, the client‑server communication protocol, how queries are parsed, optimized and executed, the role of the query cache, and provides concrete performance‑tuning advice on schema design, indexing, B+Tree mechanics, and common pitfalls.

B+Treedatabase indexingmysql
0 likes · 35 min read
Unveiling MySQL’s Query Execution: From Architecture to Optimization Strategies
High Availability Architecture
High Availability Architecture
Jun 18, 2021 · Databases

Polar Index: Removing the Global Index Latch to Accelerate InnoDB B‑Tree SMO Operations

The article explains how PolarDB's Polar Index redesigns InnoDB B‑Tree structural modification (SMO) by splitting the operation into two phases, eliminating the global index latch, reducing lock granularity, and achieving up to 11× performance gains in high‑concurrency workloads such as TPCC.

B+TreeDatabase PerformanceIndex Latch
0 likes · 12 min read
Polar Index: Removing the Global Index Latch to Accelerate InnoDB B‑Tree SMO Operations
Programmer DD
Programmer DD
May 22, 2021 · Databases

Master MySQL Indexes: B+Tree Deep Dive & Optimization Tips

This article explains MySQL's B‑Tree index fundamentals, compares MyISAM and InnoDB implementations, outlines how B+Tree structures work, and provides practical guidelines for designing effective indexes and tuning MySQL configuration to boost query performance.

B+TreeDatabase OptimizationInnoDB
0 likes · 27 min read
Master MySQL Indexes: B+Tree Deep Dive & Optimization Tips
Open Source Linux
Open Source Linux
Apr 30, 2021 · Databases

Master MySQL Query Optimization: Architecture, Caching, and Index Strategies

This article explains MySQL's logical architecture, query execution flow, client‑server protocol, query cache behavior, parsing and optimization stages, cost‑based optimizer, execution engine, and provides practical performance‑tuning advice such as schema design, data‑type choices, index creation, B‑Tree fundamentals, covering indexes, and handling COUNT, JOIN, LIMIT, and UNION queries.

B+Treeindexingmysql
0 likes · 35 min read
Master MySQL Query Optimization: Architecture, Caching, and Index Strategies
Open Source Tech Hub
Open Source Tech Hub
Apr 22, 2021 · Databases

Why MySQL Indexes Use B‑Tree, Not Hash: Understanding Index Data Structures

The article explains how MySQL indexes rely on ordered data structures—binary trees, red‑black trees, hash tables, and especially B‑Trees—to accelerate queries, compares their performance characteristics, illustrates how tree height affects I/O operations, and shows why B‑Tree is preferred for range searches.

B+TreeData Structuresindex
0 likes · 5 min read
Why MySQL Indexes Use B‑Tree, Not Hash: Understanding Index Data Structures
Top Architect
Top Architect
Apr 21, 2021 · Databases

How Many Rows Can a Single InnoDB B+ Tree Store?

This article explains the storage units of InnoDB, calculates how many rows a B+‑tree leaf page can hold, derives the total record capacity for trees of different heights, and shows how to determine the actual B+‑tree height in a MySQL table using page metadata.

B+TreeInnoDBStorage Engine
0 likes · 9 min read
How Many Rows Can a Single InnoDB B+ Tree Store?
Liangxu Linux
Liangxu Linux
Apr 20, 2021 · Databases

Master MySQL Indexes: From Fundamentals to B+ Tree Mechanics

This article explains the core principles of MySQL indexes, covering their essence, various types such as hash, binary, B‑tree and B+‑tree, the structure of primary key directories and index pages, clustered versus non‑clustered indexes, and the back‑table lookup process.

B+TreeDatabase Optimizationindex
0 likes · 16 min read
Master MySQL Indexes: From Fundamentals to B+ Tree Mechanics
Top Architect
Top Architect
Apr 19, 2021 · Databases

Understanding MySQL Index Structures, B+ Trees, and Practical Optimization Techniques

This article explains why MySQL uses B+‑tree indexes, describes the left‑most prefix rule for composite indexes, offers practical index‑design and optimization tips, outlines MyBatis first‑ and second‑level caching, details master‑slave replication, and introduces common sharding strategies and their implementation considerations.

B+TreeDatabase OptimizationMyBatis
0 likes · 12 min read
Understanding MySQL Index Structures, B+ Trees, and Practical Optimization Techniques
Architect
Architect
Apr 15, 2021 · Databases

InnoDB B+ Tree Capacity and Height: How Many Rows Can It Store?

This article explains how InnoDB’s 16 KB pages form B+‑tree indexes, calculates the number of rows a tree can hold at different heights, shows how to determine the tree’s height from the tablespace file, and why MySQL prefers B+ trees for indexing.

B+TreeDatabase IndexInnoDB
0 likes · 9 min read
InnoDB B+ Tree Capacity and Height: How Many Rows Can It Store?
MaGe Linux Operations
MaGe Linux Operations
Apr 15, 2021 · Databases

Unlock MySQL Query Performance: Deep Dive into Architecture, Optimizer, and Index Strategies

This article demystifies MySQL’s query execution by exploring its logical architecture, client‑server protocol, query cache, parsing, optimization, and execution engine, then offers practical indexing and performance‑tuning techniques—including B‑Tree fundamentals, covering indexes, and pagination tricks—to help developers write faster, more efficient SQL.

B+TreeDatabase Performancemysql
0 likes · 35 min read
Unlock MySQL Query Performance: Deep Dive into Architecture, Optimizer, and Index Strategies
NiuNiu MaTe
NiuNiu MaTe
Apr 14, 2021 · Databases

Why MySQL OFFSET Is So Slow and How to Fix It

This article examines why MySQL pagination with large OFFSET values becomes painfully slow, explains the underlying B+‑tree index mechanics, and presents two practical solutions—keyset pagination and index‑covering subqueries—to dramatically improve query performance.

B+TreeKeyset PaginationOFFSET
0 likes · 8 min read
Why MySQL OFFSET Is So Slow and How to Fix It
Architecture Digest
Architecture Digest
Apr 9, 2021 · Databases

How Many Rows Can an InnoDB B+ Tree Store?

This article explains the storage units of InnoDB, calculates how many rows a B+‑tree can hold based on page size, record size and pointer size, demonstrates how to determine the tree height from the tablespace file, and summarizes the impact on query I/O.

B+TreeDatabase StorageInnoDB
0 likes · 10 min read
How Many Rows Can an InnoDB B+ Tree Store?
Programmer DD
Programmer DD
Apr 6, 2021 · Databases

Why MySQL Pagination Is So Slow and How to Fix It

This article explores why MySQL queries with large LIMIT‑OFFSET pagination become painfully slow, explains the underlying B+‑tree index mechanics and MySQL's logical operator layers, and presents two practical solutions—key‑based pagination and index‑covering queries—to dramatically improve performance.

B+TreeDatabase PerformanceIndex Optimization
0 likes · 7 min read
Why MySQL Pagination Is So Slow and How to Fix It
Code Ape Tech Column
Code Ape Tech Column
Mar 30, 2021 · Databases

Unlock MySQL Performance: Deep Dive into B+Tree Indexes and Optimization

This article explains the fundamentals of MySQL indexes, the B+Tree data structure, differences between MyISAM and InnoDB implementations, practical tips for creating effective composite indexes, and essential server configuration and SQL tuning techniques to dramatically improve query performance.

B+TreeDatabaseOptimizationIndexDesign
0 likes · 29 min read
Unlock MySQL Performance: Deep Dive into B+Tree Indexes and Optimization
ITPUB
ITPUB
Jan 19, 2021 · Databases

Why Indexes Speed Up Database Queries: From Binary Trees to B+ Trees

This article explains how database indexes improve query performance by exploring binary trees, binary search, balanced trees, B‑trees, and B+‑trees, illustrating their structures, advantages, disadvantages, and the impact of disk I/O on overall efficiency.

B+TreeB-treeBinary Search
0 likes · 17 min read
Why Indexes Speed Up Database Queries: From Binary Trees to B+ Trees
Top Architect
Top Architect
Dec 24, 2020 · Databases

Understanding MySQL Indexes: B+Tree Structure, Implementation, and Optimization

This article explains why MySQL uses B+‑tree indexes, describes the principles of B‑tree and B+‑tree structures, compares MyISAM and InnoDB index implementations, and provides practical optimization tips such as using auto‑increment primary keys, the left‑most prefix rule, and proper configuration settings.

B+TreeDatabase OptimizationInnoDB
0 likes · 22 min read
Understanding MySQL Indexes: B+Tree Structure, Implementation, and Optimization
Code Ape Tech Column
Code Ape Tech Column
Dec 23, 2020 · Databases

Master MySQL Indexes: Why B+Tree Outperforms Other Structures

This article explains how proper index creation boosts MySQL query performance, detailing the mechanics of indexes, why B+Tree is chosen over binary and balanced trees, the storage differences between MyISAM and InnoDB, and practical guidelines for designing effective single‑column, composite, and covering indexes.

B+TreeDatabase Optimizationindexing
0 likes · 19 min read
Master MySQL Indexes: Why B+Tree Outperforms Other Structures
Senior Brother's Insights
Senior Brother's Insights
Nov 23, 2020 · Databases

Master MySQL Indexes: Types, Structures, and Optimization Strategies

This article explains the fundamental concepts and practical design of MySQL indexes, covering implementation-level index types, application-level index categories, the differences between clustered and non‑clustered indexes, B‑Tree and hash structures, covering indexes, and best‑practice strategies for optimal query performance.

B+TreeClustered IndexHash Index
0 likes · 14 min read
Master MySQL Indexes: Types, Structures, and Optimization Strategies
Open Source Tech Hub
Open Source Tech Hub
Oct 31, 2020 · Databases

Why MySQL Indexes Matter: From B‑Tree to Covering Indexes Explained

This article explains how MySQL indexes work, comparing binary search trees, red‑black trees, hash tables, B‑trees, B+‑trees, and the differences between MyISAM and InnoDB implementations, and it details primary, secondary, covering, and composite index usage with practical examples.

B+TreeComposite IndexInnoDB
0 likes · 10 min read
Why MySQL Indexes Matter: From B‑Tree to Covering Indexes Explained
ITPUB
ITPUB
Oct 19, 2020 · Databases

Why MySQL InnoDB Chooses B+ Trees: A Deep Dive into Index Design

This article explains why MySQL's default InnoDB storage engine uses B+ trees instead of B trees or hash indexes, covering storage engine basics, query performance, I/O considerations, and the structural advantages that make B+ trees ideal for OLTP workloads.

B+TreeInnoDBOLTP
0 likes · 16 min read
Why MySQL InnoDB Chooses B+ Trees: A Deep Dive into Index Design
Architecture Digest
Architecture Digest
Oct 15, 2020 · Databases

Understanding MySQL Indexes: B‑Tree, B+Tree, and Index Design Principles

This article explains how MySQL indexes work, compares binary trees, B‑Tree and B+Tree structures, describes their implementation in MyISAM and InnoDB storage engines, and provides practical guidelines for creating efficient single‑column, composite, and covering indexes to improve query performance.

B+TreeDatabase OptimizationStorage Engines
0 likes · 17 min read
Understanding MySQL Indexes: B‑Tree, B+Tree, and Index Design Principles
Programmer DD
Programmer DD
Oct 13, 2020 · Databases

How Many Rows Can an InnoDB B+ Tree Store? A Deep Dive

This article explains how InnoDB’s page size, row size, and B+‑tree structure determine that a single B+ tree can hold roughly twenty‑million rows, shows how to calculate tree height from the root page, and demonstrates the concepts with SQL queries and practical examples.

B+TreeDatabase StorageInnoDB
0 likes · 11 min read
How Many Rows Can an InnoDB B+ Tree Store? A Deep Dive
Java Captain
Java Captain
Oct 10, 2020 · Databases

Understanding MySQL and Elasticsearch Indexing Mechanisms

This article compares MySQL's B+ tree indexing with Elasticsearch's inverted index, explaining underlying data structures such as hash tables, ordered arrays, balanced binary trees, skip lists, and term dictionaries, and discusses optimization techniques like bitmap intersections for efficient query processing.

B+TreeDataStructuresInvertedIndex
0 likes · 15 min read
Understanding MySQL and Elasticsearch Indexing Mechanisms
Laravel Tech Community
Laravel Tech Community
Aug 6, 2020 · Databases

MySQL Index Types, Creation Methods, and Optimization Strategies

This article explains MySQL's B‑Tree index structure, describes various index types such as primary, unique, normal, full‑text, and composite indexes, and provides practical techniques for creating efficient indexes, choosing column order, using prefix and covering indexes, and optimizing query sorting.

B+TreeDatabase Optimizationindex
0 likes · 12 min read
MySQL Index Types, Creation Methods, and Optimization Strategies
dbaplus Community
dbaplus Community
Jul 8, 2020 · Databases

Why MySQL Uses B+ Trees: A Step‑by‑Step Dive into Index Data Structures

This article walks through the evolution of MySQL index implementations—from hash tables and binary search trees to AVL, red‑black, B‑trees and finally B+ trees—explaining their performance trade‑offs, disk‑I/O considerations, and how InnoDB and MyISAM store data and indexes differently.

B+TreeDataStructureInnoDB
0 likes · 21 min read
Why MySQL Uses B+ Trees: A Step‑by‑Step Dive into Index Data Structures
Selected Java Interview Questions
Selected Java Interview Questions
Jul 3, 2020 · Databases

Understanding MySQL Index Structures: From Simple Tables to B+ Trees

This article explains how MySQL stores data using pages, page directories, and multi‑page structures, demonstrates why MySQL silently sorts rows on insert, and shows how these mechanisms combine into the B+‑tree index that optimizes query performance and supports clustering, non‑clustering, and composite indexes.

B+TreeComposite IndexDatabase Pages
0 likes · 24 min read
Understanding MySQL Index Structures: From Simple Tables to B+ Trees
Liangxu Linux
Liangxu Linux
Jun 27, 2020 · Databases

Mastering MySQL Indexes: Concepts, Types, and Implementation Details

This article explains the fundamentals of MySQL indexes, covering their conceptual purpose, logical classifications, underlying data structures such as hash, B‑Tree, and B+Tree, physical storage differences between clustered and non‑clustered indexes, and practical tips for effective index optimization.

B+TreeBTreeClustered Index
0 likes · 22 min read
Mastering MySQL Indexes: Concepts, Types, and Implementation Details
Architecture Digest
Architecture Digest
Jun 19, 2020 · Databases

How Many Rows Can an InnoDB B+ Tree Store?

This article explains the storage units of InnoDB, how B+‑tree indexes are organized on pages, calculates the maximum number of rows a B+ tree can hold based on page size and pointer count, and shows how to determine the tree height from the tablespace file.

B+TreeInnoDBPage Size
0 likes · 9 min read
How Many Rows Can an InnoDB B+ Tree Store?
Programmer DD
Programmer DD
Apr 9, 2020 · Databases

How Many Rows Can a Single InnoDB B+ Tree Store? A Deep Dive

This article explains how InnoDB organizes data with B+ trees, calculates the maximum number of rows a single tree can hold (around 20 million), and shows how page size, pointer count, and tree height affect MySQL index performance.

B+TreeInnoDBStorage Engine
0 likes · 11 min read
How Many Rows Can a Single InnoDB B+ Tree Store? A Deep Dive
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
DataFunTalk
DataFunTalk
Feb 26, 2020 · Databases

ByteGraph: ByteDance’s Distributed Graph Database and Graph Computing System – Architecture, Data Model, and Practices

This article presents an in‑depth technical overview of ByteGraph, ByteDance’s self‑built distributed graph database and its accompanying graph‑computing engine, covering graph data characteristics, the directed‑property graph model, API design, three‑tier system architecture, storage strategies using KV stores and B‑Trees, hotspot handling, indexing, and future research directions.

B+TreeByteGraphGraph Database
0 likes · 33 min read
ByteGraph: ByteDance’s Distributed Graph Database and Graph Computing System – Architecture, Data Model, and Practices
Architecture Digest
Architecture Digest
Dec 6, 2019 · Databases

Understanding InnoDB Index Structures: B+ Trees, Covering Indexes, and Best Practices

This article explains how MySQL InnoDB implements indexes with B+ trees, describes primary and secondary (clustered and non‑clustered) indexes, the concepts of row lookup, covering indexes, composite indexes, the left‑most prefix rule, index push‑down, and provides practical guidelines for creating and maintaining efficient indexes.

B+TreeDatabase OptimizationInnoDB
0 likes · 10 min read
Understanding InnoDB Index Structures: B+ Trees, Covering Indexes, and Best Practices
Ziru Technology
Ziru Technology
Oct 21, 2019 · Databases

Why MySQL Indexes Aren’t Always Faster: Models, Types, and Common Pitfalls

Understanding MySQL indexes—from hash tables, ordered arrays, and B+ trees—to their practical use cases, including clustered and secondary indexes, reveals why they boost query speed, when they may hinder performance, and how factors like selectivity, dirty page flushing, type mismatches, and function usage affect query efficiency.

B+TreeSQL Optimizationindexing
0 likes · 10 min read
Why MySQL Indexes Aren’t Always Faster: Models, Types, and Common Pitfalls
Big Data Technology Architecture
Big Data Technology Architecture
Aug 23, 2019 · Databases

How Many Rows Can an InnoDB B+ Tree Store? Explanation, Calculations, and Practical Verification

This article explains the storage capacity of InnoDB B+‑tree indexes by detailing page size, record size, pointer calculations, tree height effects, and real‑world verification using page‑level metadata, showing that a typical B+‑tree can hold tens of millions of rows with only 1‑3 I/O operations.

B+TreeInnoDBdatabase
0 likes · 10 min read
How Many Rows Can an InnoDB B+ Tree Store? Explanation, Calculations, and Practical Verification
ITPUB
ITPUB
Aug 22, 2019 · Databases

How Many Rows Can a Single InnoDB B+ Tree Store? A Deep Dive

This article explains how InnoDB’s 16 KB pages, row size assumptions, and B+‑tree node capacities combine to allow roughly 20 million rows per tree, demonstrates how to calculate tree height from page metadata, and shows why MySQL chooses B+‑trees for primary‑key indexes.

B+TreeDatabase IndexInnoDB
0 likes · 11 min read
How Many Rows Can a Single InnoDB B+ Tree Store? A Deep Dive
Aikesheng Open Source Community
Aikesheng Open Source Community
Aug 9, 2019 · Databases

InnoDB Index Build Process and Fill Factor in MySQL 5.7+

Since MySQL 5.7 InnoDB builds secondary indexes using a bottom‑up, sorted‑index approach, the article explains the three build phases, presents a step‑by‑step B‑tree construction example with SQL code, and discusses the innodb_fill_factor setting, its impact, advantages, and drawbacks.

B+TreeInnoDBdatabase
0 likes · 11 min read
InnoDB Index Build Process and Fill Factor in MySQL 5.7+
Java Captain
Java Captain
Jul 10, 2019 · Databases

Understanding Database Index Structures: From Binary Trees to B‑Tree and B+Tree

This article explains how library indexing inspires database indexing, introduces binary search trees, AVL trees, B‑Tree and B+Tree structures, and details InnoDB and MyISAM storage mechanisms, page organization, clustered versus non‑clustered indexes, and practical index‑optimization advice.

B+TreeB-TreeData Structures
0 likes · 19 min read
Understanding Database Index Structures: From Binary Trees to B‑Tree and B+Tree
Architect's Tech Stack
Architect's Tech Stack
Jun 4, 2019 · Databases

Understanding B+ Tree, Hash, and Full‑Text Indexes in MySQL

This article explains the principles, structures, and operations of MySQL indexes, covering B+ tree indexes, their search, insertion, and deletion mechanisms, as well as hash indexes, adaptive hash indexing, and full‑text indexes with inverted indexing, cache handling, and practical limitations.

B+TreeFull‑Text SearchHash Index
0 likes · 14 min read
Understanding B+ Tree, Hash, and Full‑Text Indexes in MySQL
Java High-Performance Architecture
Java High-Performance Architecture
Mar 28, 2019 · Databases

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

This article explains the main index structures used in MySQL—including hash tables, ordered arrays, search trees, and B+ trees—covers why InnoDB prefers B+ trees, the benefits of auto‑increment primary keys, and key concepts such as covering indexes, the left‑most prefix rule, and index‑pushdown for query optimization.

B+TreeDatabase Optimizationindexing
0 likes · 7 min read
Mastering MySQL Indexes: From Hash Tables to B+ Trees and Beyond
ITPUB
ITPUB
Feb 22, 2019 · Databases

Why B‑Tree vs B+Tree Matters: MySQL Indexing Essentials

This article explains MySQL’s storage engines, compares B‑Tree and B+Tree indexes, details their structures and search processes, and outlines key principles for designing efficient indexes to avoid slow queries in relational databases.

B+TreeB-Treedatabase
0 likes · 12 min read
Why B‑Tree vs B+Tree Matters: MySQL Indexing Essentials
Programmer DD
Programmer DD
Nov 17, 2018 · Databases

How InnoDB Indexes Work: From Data Pages to B+ Trees

This article explains how InnoDB stores data pages, builds page directories, and uses B+‑tree indexes—including clustered, secondary, and composite indexes—to enable fast record lookup, while also covering MyISAM indexing differences and the SQL statements for creating and dropping indexes.

B+TreeInnoDBindex
0 likes · 27 min read
How InnoDB Indexes Work: From Data Pages to B+ Trees
Java Captain
Java Captain
Oct 6, 2018 · Databases

Exploring MySQL Database Fundamentals and Indexing Principles

This article examines MySQL database fundamentals, including storage architecture, block-based data access, disk I/O bottlenecks, and detailed explanations of B+Tree and hash indexes in MyISAM and InnoDB, while offering practical guidance on index design, selectivity, left‑most prefix rules, and using EXPLAIN for SQL optimization.

B+TreeDatabase FundamentalsSQL Optimization
0 likes · 11 min read
Exploring MySQL Database Fundamentals and Indexing Principles
Java Captain
Java Captain
Jul 7, 2018 · Databases

Understanding MySQL Indexes, B+Tree vs Hash, Partitioning, and Redis Fundamentals

This article explains why auto‑increment primary keys are preferred in MySQL, how B+Tree and hash indexes differ, the benefits of composite and partitioned indexes, isolation levels, MVCC, row‑level locking, triggers, stored procedures, optimization tips, MyISAM vs InnoDB, table design guidelines, and also covers Redis architecture, persistence, replication, and eviction policies.

B+TreePartitioningdatabase
0 likes · 28 min read
Understanding MySQL Indexes, B+Tree vs Hash, Partitioning, and Redis Fundamentals
Beike Product & Technology
Beike Product & Technology
Jun 1, 2018 · Databases

InnoDB Transaction and Index Principles

This article explains InnoDB's transaction and index principles, covering ACID properties, transaction logs, MVCC, locking mechanisms, and B+ tree index structures to help backend developers understand how InnoDB ensures data consistency and high concurrency.

ACIDB+TreeIndex Optimization
0 likes · 11 min read
InnoDB Transaction and Index Principles
ITPUB
ITPUB
Oct 31, 2017 · Databases

How Database Indexing Works: A Deep Dive into Performance Gains

This article explains why database indexes are essential, describes how they are structured and stored, walks through concrete calculations for a 5‑million‑row MyISAM table, compares linear and binary search costs, and outlines when and how to use indexes effectively.

B+Treedatabase indexingdisk storage
0 likes · 10 min read
How Database Indexing Works: A Deep Dive into Performance Gains
21CTO
21CTO
Oct 20, 2017 · Databases

Master MySQL Indexes: Boost Query Performance with Smart B+Tree Strategies

This guide explains MySQL B+Tree index structures, their advantages, how to create primary, unique, ordinary, full‑text, composite and prefix indexes, and provides practical rules and tips for designing efficient indexes, query patterns, and sorting strategies to dramatically improve database performance.

B+Treedatabaseindex
0 likes · 14 min read
Master MySQL Indexes: Boost Query Performance with Smart B+Tree Strategies
ITPUB
ITPUB
Jun 2, 2017 · Databases

Essential Principles for Building Effective Oracle Indexes (B‑Tree & Bitmap)

This guide outlines practical principles for creating Oracle indexes, compares B‑Tree and bitmap index types, explains their creation syntax, highlights performance characteristics, and lists common situations where indexes may be ignored or unsuitable.

B+TreeBitmapDatabase Performance
0 likes · 8 min read
Essential Principles for Building Effective Oracle Indexes (B‑Tree & Bitmap)
dbaplus Community
dbaplus Community
May 10, 2017 · Databases

Why InnoDB Needs a Primary Key and How B‑Tree Indexes Work

This article explains the data structures and algorithms behind MySQL indexing, covering B‑Tree fundamentals, insertion and deletion steps with visual examples, the differences between B‑Tree and B+Tree, InnoDB's clustered and secondary index implementations, and why monotonically increasing primary keys improve performance.

B+TreeB-TreeInnoDB
0 likes · 15 min read
Why InnoDB Needs a Primary Key and How B‑Tree Indexes Work