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.
This article provides a comprehensive overview of MySQL indexing, covering B‑Tree and B+Tree structures, common search algorithms, storage engine differences, and practical optimization techniques such as composite and prefix indexes to improve query performance.
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.
This article explains how database indexes are implemented using B+ trees, describing their structure, advantages such as shallow depth and ordered leaf nodes, and how they reduce disk I/O, illustrating calculations of node capacity and emphasizing the importance of index size for performance.
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.
This article explains the evolution from binary search trees to AVL and red‑black trees, introduces B and B+ trees, compares their properties and performance, and clarifies why B+ trees are the preferred indexing structure for MySQL databases.
This article explains MongoDB indexing fundamentals, covering B‑Tree structures, index selectivity, unique and compound indexes, practical code examples, and guidelines to optimize query performance and reduce I/O operations.
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.
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.
WeChat’s WCDB component tackles pervasive SQLite corruption on mobile devices by combining dump‑based, backup, and B‑tree parsing recovery methods, achieving up to 78% success while supporting encrypted databases, large data volumes, and seamless user experience.
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.
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.
This article demonstrates a step‑by‑step method to confirm that InnoDB secondary index leaf pages store rows sorted first by the secondary key and then by the primary key, using bcview, mysqlblock, and a small C utility to read raw .ibd pages.
This article explains the theoretical foundations of relational databases, outlines the essential storage, engine, and UI layers, and walks through a concrete minimal implementation using fixed‑length tables, B+‑tree indexes, simple SQL parsing with regular expressions, and a TCP‑based client interface.
This article explains MySQL’s indexing fundamentals, the left‑most prefix rule, B+‑tree structure, disk I/O considerations, and provides step‑by‑step methods and real‑world cases for diagnosing and optimizing slow queries in production systems.
This article explains MySQL index fundamentals, B+‑tree structures, disk I/O considerations, and practical steps for diagnosing and optimizing slow queries, illustrated with multiple real‑world examples and concrete indexing guidelines.
This article provides a comprehensive overview of MySQL indexing, covering the theoretical foundations of B‑Tree and B+Tree data structures, the differences between MyISAM and InnoDB index implementations, and practical optimization techniques such as left‑most prefix usage, selectivity analysis, and prefix indexing.
This article examines MySQL indexing theory, covering B‑Tree and B+Tree structures, storage‑engine differences between MyISAM and InnoDB, left‑most prefix rules, index selectivity, prefix indexes, and practical optimization techniques for high‑performance query execution.
This article explains the characteristics and usage scenarios of B-Tree and Hash indexes in MySQL, including supported operators, example queries, when indexes are applied or ignored, and performance considerations for different storage engines such as MEMORY.
This article illustrates the structure of a B+ tree, explains how leaf and non‑leaf nodes store data and pointers, and walks through a concrete search for the key 29, highlighting the three disk I/O operations required to locate the value.
This article explains the fundamentals of B+Tree indexes, why they matter for SQL performance, and presents three concise indexing techniques—single, composite, and covering indexes—to reduce resource consumption, I/O, and sorting overhead in relational databases.
This article explains how to build a minimal database by storing records in a fixed‑length text file, using B‑tree structures for efficient lookup, creating index files for non‑primary fields, and outlines additional features such as SQL parsing, joins, transactions, backup and remote access.
