BestHub
Sign in
Tag

B+ Tree

0 views collected around this technical thread.

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+ TreeMySQLclustered index
0 likes · 10 min read
Understanding MySQL Indexes: Types, B+Tree Structure, and Clustered vs. Non‑Clustered Indexes
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 StructuresEXT4
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 StructuresMySQL Indexing
0 likes · 13 min read
Why MySQL Chooses B+ Trees: From BSTs to Efficient Disk Indexes
Tencent Cloud Developer
Tencent Cloud Developer
Dec 4, 2024 · Databases

Building a Distributed Database Storage Engine: From LSM Tree to Data Sharding

This article walks through building a database storage engine from a simple shell script to a full distributed key‑value system, covering in‑memory indexing, SSTable creation, LSM‑Tree architecture with compaction, replication strategies, and sharding techniques for scaling across multiple machines.

B+ TreeData ShardingDistributed Database
0 likes · 38 min read
Building a Distributed Database Storage Engine: From LSM Tree to Data Sharding
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+ TreeDatabase OptimizationHotColdArchiving
0 likes · 15 min read
Evaluating and Optimizing Large MySQL Tables: Partitioning, Sharding, and Hot‑Cold Archiving Strategies
IT Services Circle
IT Services Circle
Sep 15, 2024 · Databases

The Story Behind SQLite: From Naval Software to the World's Most Popular Embedded Database

This article recounts how SQLite was created by Richard Hipp to solve reliability issues on a U.S. Navy destroyer, evolved from a simple file‑based engine into an open‑source, B‑Tree powered embedded database that now powers billions of devices, smartphones, browsers, and applications worldwide.

B+ TreeDatabase ArchitectureEmbedded Database
0 likes · 7 min read
The Story Behind SQLite: From Naval Software to the World's Most Popular Embedded Database
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+ TreeDatabase OptimizationMySQL
0 likes · 17 min read
Understanding MySQL Indexes: Models, Maintenance, Utilization, and Optimization
Lobster Programming
Lobster Programming
Jul 31, 2024 · Databases

How to Estimate MySQL Single-Table Capacity: The 20 Million Row Rule Explained

This article breaks down the reasoning behind MySQL’s commonly cited 20 million‑row limit for a single table by analyzing page size, B+‑tree structure, storage overhead, and how leaf and index pages combine to estimate maximum row counts.

B+ TreeDatabase CapacityMySQL
0 likes · 5 min read
How to Estimate MySQL Single-Table Capacity: The 20 Million Row Rule Explained
JD Retail Technology
JD Retail Technology
Jul 30, 2024 · Databases

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

This article provides a comprehensive guide to MySQL indexing, covering index data structures, maintenance mechanisms, query execution, optimization techniques such as left‑most prefix, index push‑down, unique indexes, index selection, and common pitfalls that cause index inefficiency.

B+ TreeMySQLSQL Optimization
0 likes · 17 min read
Understanding MySQL Indexes: Models, Maintenance, Utilization, and Optimization
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+ TreeFull-Text SearchHash Index
0 likes · 12 min read
Database Indexing Algorithms: B‑Tree vs Hash Indexing
Architect's Guide
Architect's Guide
Feb 4, 2024 · Databases

Evaluating Large MySQL Table Size and Optimizing Query Performance with Partitioning, Sharding, and Archiving

This article explains how to assess MySQL table size through table capacity, disk usage, and instance resources, illustrates the impact of B+‑tree index depth on query speed, and presents three practical solutions—table partitioning, database sharding, and hot‑cold data archiving—to improve performance.

B+ TreeDatabase OptimizationMySQL
0 likes · 15 min read
Evaluating Large MySQL Table Size and Optimizing Query Performance with Partitioning, Sharding, and Archiving
JD Retail Technology
JD Retail Technology
Jan 18, 2024 · Databases

Understanding MySQL Indexes: Data Structures and Implementation Principles

This article explains why slow SQL queries occur, how MySQL indexes dramatically improve query speed, and details the underlying data structures—binary tree, hash, B‑Tree, B+Tree—as well as storage engine differences and composite index rules for optimal performance.

B+ TreeData StructuresInnoDB
0 likes · 8 min read
Understanding MySQL Indexes: Data Structures and Implementation Principles
政采云技术
政采云技术
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
Cognitive Technology Team
Cognitive Technology Team
Jan 1, 2024 · Databases

Principles, Types, Drawbacks, and Best Practices of MySQL Indexes

This article explains how MySQL indexes work, compares clustered and non‑clustered indexes, outlines their advantages and disadvantages, and provides practical design guidelines to improve query performance and maintainability.

B+ TreeDesignMySQL
0 likes · 6 min read
Principles, Types, Drawbacks, and Best Practices of MySQL Indexes
Spring Full-Stack Practical Cases
Spring Full-Stack Practical Cases
Dec 13, 2023 · Databases

How Index Condition Pushdown Boosts MySQL Query Performance: A 90× Speed Test

This article explains MySQL index types, B+Tree structures, secondary indexes, and demonstrates how enabling Index Condition Pushdown (ICP) can accelerate a query on a 6‑million‑row table by roughly ninety times, providing detailed setup, commands, and performance results.

B+ TreeICPMySQL
0 likes · 9 min read
How Index Condition Pushdown Boosts MySQL Query Performance: A 90× Speed Test
Java Architect Essentials
Java Architect Essentials
Nov 2, 2023 · Databases

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

This article explains how to evaluate MySQL table size, understand B+‑tree limitations, and improve query performance by using table partitioning, horizontal/vertical sharding, and hot‑cold data archiving, while also comparing the trade‑offs of each approach for practical selection.

B+ TreeCold ArchivingMySQL
0 likes · 15 min read
Optimizing Large MySQL Tables: Partitioning, Sharding, and Cold 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