BestHub
Sign in
Tagged articles

clustered index

36 articles · Page 1 of 1
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+ TreeComposite IndexInnoDB
0 likes · 20 min read
Beyond Adding Indexes: From Disk Pages to B+Tree – Master MySQL Index Design and Operation
Architect's Guide
Architect's Guide
Aug 8, 2026 · Databases

Why Do Indexes Speed Up Database Queries?

The article explains how database indexes, built on sorted data and binary search, dramatically reduce query time compared to full table scans, while also covering storage fundamentals, the cost of excessive indexes, clustered indexes, index failure scenarios, and practical SQL optimization techniques.

SQL optimizationbinary searchclustered index
0 likes · 12 min read
Why Do Indexes Speed Up Database Queries?
Dabaoshi
Dabaoshi
Jul 20, 2026 · Databases

Understanding InnoDB B+ Tree Indexes: Structure and Real‑World Use Cases

The article explains how InnoDB implements indexes as B+ trees, detailing their evolution from simple page directories, the differences between clustered and secondary indexes, the costs of indexing, and the specific query patterns and scenarios where such indexes are effective.

B+ TreeIndexingInnoDB
0 likes · 14 min read
Understanding InnoDB B+ Tree Indexes: Structure and Real‑World Use Cases
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+ TreeCovering IndexMySQL
0 likes · 11 min read
Why Databases Skip the First Page: How Indexes Speed Up Queries
Architect's Guide
Architect's Guide
May 22, 2026 · Databases

How Indexes Speed Up Database Queries: A Clear Explanation

The article explains how database indexes work by comparing them to a book’s table of contents, describes underlying storage mechanisms, demonstrates binary search on sorted records, and discusses the benefits, trade‑offs, and common pitfalls of using clustered and non‑clustered indexes.

Database IndexesSQL optimizationbinary search
0 likes · 12 min read
How Indexes Speed Up Database Queries: A Clear Explanation
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+ TreeCovering IndexEXPLAIN
0 likes · 12 min read
Master MySQL Indexes: Deep Dive into B+ Tree Structure and Optimization Strategies
Top Architect
Top Architect
Nov 11, 2025 · Databases

Master MySQL Indexes: Types, Structures, and Performance Trade‑offs

This article explains MySQL index fundamentals, covering what indexes are, their advantages and drawbacks, underlying data structures such as hash tables and B‑/B+‑trees, and the classification of clustered, non‑clustered, primary, secondary, unique, prefix, and full‑text indexes, with practical SQL examples and diagrams.

B-TreeMySQLNon-clustered Index
0 likes · 9 min read
Master MySQL Indexes: Types, Structures, and Performance Trade‑offs
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+ TreeDatabase IndexesMySQL
0 likes · 9 min read
Mastering MySQL Indexes: From Hash Tables to B+ Trees Explained
Senior Brother's Insights
Senior Brother's Insights
Sep 15, 2025 · Databases

Understanding MySQL Clustered vs Non‑Clustered Indexes: When and How to Use Them

This article provides a comprehensive review of MySQL’s two primary index types—clustered (clustered index) and non‑clustered (non‑clustered index)—explaining their storage mechanisms, performance trade‑offs, typical use cases, and best‑practice guidelines for selecting the appropriate index in database design.

Database OptimizationMySQLNon-clustered Index
0 likes · 14 min read
Understanding MySQL Clustered vs Non‑Clustered Indexes: When and How to Use Them
Architect's Guide
Architect's Guide
Sep 14, 2025 · Databases

Why Database Indexes Speed Up Queries: From Storage Basics to Binary Search

This article explains how databases store data on various storage devices, why indexes dramatically improve query performance through sorted structures and binary search, and outlines practical SQL optimization techniques while warning about the trade‑offs of excessive indexing.

Query OptimizationSQL Performancebinary search
0 likes · 11 min read
Why Database Indexes Speed Up Queries: From Storage Basics to Binary Search
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+ TreeDatabase OptimizationInnoDB
0 likes · 10 min read
Why MySQL Indexes Matter: From Basics to B+Tree Mastery
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+ TreeMySQLPerformance
0 likes · 10 min read
Understanding MySQL Indexes: Types, B+Tree Structure, and Clustered vs. Non‑Clustered Indexes
Architect's Must-Have
Architect's Must-Have
Mar 18, 2025 · Databases

Master MySQL Indexes: From Basics to B+Tree Optimization

This article explains what MySQL indexes are, how they work, their advantages and drawbacks, the different index types—including primary, ordinary, composite, full‑text, clustered and non‑clustered—and compares B‑Tree with B+Tree structures to help you design faster, more efficient queries.

B+TreeInnoDBMySQL
0 likes · 12 min read
Master MySQL Indexes: From Basics to B+Tree Optimization
dbaplus Community
dbaplus Community
Oct 29, 2024 · Databases

Why UUID v7 Beats UUID v4 as a Clustered Index – Performance Test Results

This article compares UUID v4 and UUID v7 as clustered index keys, explains their structures, lists pros and cons, describes a Docker‑based MySQL experiment using Node.js and Go, presents single‑ and multi‑thread insertion timings, and analyses why the time‑ordered UUID v7 (and serial IDs) outperform random UUID v4.

DockerGoMySQL
0 likes · 14 min read
Why UUID v7 Beats UUID v4 as a Clustered Index – Performance Test Results
Architect's Guide
Architect's Guide
Oct 19, 2023 · Databases

Understanding Database Indexes: Storage Principles, Types, and Optimization Techniques

This article explains how computer storage works, why database indexes dramatically speed up queries, the mechanics of binary search, the differences between clustered and non‑clustered indexes, common pitfalls of over‑indexing, and practical SQL optimization strategies to avoid full table scans and index invalidation.

SQL optimizationStoragebinary search
0 likes · 12 min read
Understanding Database Indexes: Storage Principles, Types, and Optimization Techniques
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+ TreeIndex Pushdown
0 likes · 18 min read
Mastering MySQL Indexes: Advanced Concepts and Practical Tips
ITPUB
ITPUB
Feb 26, 2023 · Databases

Why InnoDB Stores Primary Keys in Secondary Index Leaves – A Deep Dive

This article explains InnoDB’s clustered and secondary index structures, why secondary index leaf nodes store primary key values, how lookups trigger “row‑lookup” (回表) operations, and how covering indexes can eliminate those extra scans, illustrated with MySQL examples.

Covering IndexInnoDBMySQL
0 likes · 7 min read
Why InnoDB Stores Primary Keys in Secondary Index Leaves – A Deep Dive
Architect's Guide
Architect's Guide
Feb 19, 2023 · Databases

Why Database Indexes Speed Up Queries: Principles, Storage Mechanics, and Optimization Techniques

This article explains how database indexes improve query speed by leveraging storage principles, binary search, and B‑tree structures, discusses clustered versus non‑clustered indexes, outlines the trade‑offs of indexing, and provides practical SQL optimization tips to avoid full table scans and index misuse.

SQLStorageclustered index
0 likes · 12 min read
Why Database Indexes Speed Up Queries: Principles, Storage Mechanics, and Optimization Techniques
Architect's Guide
Architect's Guide
Jan 24, 2023 · Databases

Understanding Database Indexes: How They Accelerate Query Performance

This article explains the evolution of data storage, the fundamentals of computer storage devices, how database indexes function like a book's table of contents, the role of binary search, the benefits and drawbacks of indexes, clustered versus non‑clustered indexes, and common SQL optimization techniques.

Query OptimizationSQLStorage
0 likes · 11 min read
Understanding Database Indexes: How They Accelerate Query Performance
Top Architect
Top Architect
Oct 25, 2022 · Databases

Understanding Database Indexes: Storage Principles, Binary Search, and Optimization Techniques

This article explains how databases store data on various storage media, why indexes dramatically speed up queries through sorted structures and binary search, discusses different index types such as clustered indexes, and outlines common SQL optimization practices while warning against excessive indexing and typical pitfalls.

SQL optimizationbinary searchclustered index
0 likes · 12 min read
Understanding Database Indexes: Storage Principles, Binary Search, and Optimization Techniques
Architect's Journey
Architect's Journey
Aug 26, 2021 · Databases

Peeling Back MySQL InnoDB: A Deep Dive into Its Storage Engine

This article dissects MySQL's InnoDB storage engine by first exposing the internal page layout, then explaining the clustered index organization, and finally detailing the slot mechanism used for intra‑page queries, while illustrating insertion strategies and space‑reclamation techniques.

Database InternalsInnoDBMySQL
0 likes · 11 min read
Peeling Back MySQL InnoDB: A Deep Dive into Its Storage Engine
Python Programming Learning Circle
Python Programming Learning Circle
Mar 18, 2021 · Databases

Performance Comparison of Clustered and Non-Clustered Indexes in SQL Server and MySQL

This article investigates how clustered and non‑clustered indexes affect query, insert, update, and delete performance in SQL Server 2008R2 and MySQL 5.5 using three test tables, presenting detailed timing results and concluding that clustered indexes are optimal for small datasets while indexes dramatically speed up queries in MySQL.

Non-clustered IndexSQL Serverclustered index
0 likes · 7 min read
Performance Comparison of Clustered and Non-Clustered Indexes in SQL Server and MySQL
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+ TreeCovering IndexMySQL
0 likes · 14 min read
Master MySQL Indexes: Types, Structures, and Optimization Strategies
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+ TreeBTreeDatabase Indexes
0 likes · 22 min read
Mastering MySQL Indexes: Concepts, Types, and Implementation Details
Programmer DD
Programmer DD
Mar 18, 2019 · Databases

Why Database Indexes Are the Secret Weapon for Faster Queries

Database indexes, akin to a dictionary’s table of contents, dramatically speed up data retrieval, and this article explains what indexes are, how composite indexes work, the left‑most prefix rule, and the difference between clustered and non‑clustered indexes, using clear analogies and examples.

Composite IndexSQLclustered index
0 likes · 8 min read
Why Database Indexes Are the Secret Weapon for Faster Queries
ITPUB
ITPUB
Feb 19, 2017 · Databases

Turning an 89ms Query into 0ms: Real‑World SQL Server Index Optimization

The article recounts a performance bottleneck in a Windows service that processed only about 12 records per second, analyzes why a simple SELECT TOP 1 query without proper indexes caused 89 ms latency, and demonstrates step‑by‑step how adding appropriate clustered and non‑clustered indexes reduced the execution time to virtually zero, while also discussing broader indexing strategies and common LEFT JOIN pitfalls.

Index OptimizationNon-clustered IndexSQL Server
0 likes · 9 min read
Turning an 89ms Query into 0ms: Real‑World SQL Server Index Optimization