<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Performance on Zhuifeng Notes</title><link>https://4f0a9a3b.wangpeng.pages.dev/en/tags/performance/</link><description>Recent content in Performance on Zhuifeng Notes</description><generator>Hugo</generator><language>en</language><lastBuildDate>Tue, 25 Aug 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://4f0a9a3b.wangpeng.pages.dev/en/tags/performance/index.xml" rel="self" type="application/rss+xml"/><item><title>MySQL Indexing Internals and Best Practices</title><link>https://4f0a9a3b.wangpeng.pages.dev/en/tech/mysql/indexing/</link><pubDate>Tue, 25 Aug 2026 00:00:00 +0000</pubDate><guid>https://4f0a9a3b.wangpeng.pages.dev/en/tech/mysql/indexing/</guid><description>&lt;p&gt;Indexes are the decisive factor for MySQL query performance. Understanding InnoDB&amp;rsquo;s B+Tree index structure is the only way to write SQL that truly hits indexes.&lt;/p&gt;&#10;&lt;h2 id="btree-and-the-clustered-index"&gt;B+Tree and the Clustered Index&#10;&lt;/h2&gt;&#10;&lt;p&gt;InnoDB organizes indexes with a B+Tree whose non-leaf nodes only store index keys for navigation, while all data lives in leaf nodes that are linked in a doubly-linked list, which is ideal for range scans.&lt;/p&gt;</description></item></channel></rss>