<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>InnoDB on Answer</title>
    <link>https://answer.freetools.me/tags/innodb/</link>
    <description>Recent content in InnoDB on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 15:44:51 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/innodb/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>数据库Buffer Pool为何拒绝LRU从Belady最优到CLOCK-Sweep的六十年算法博弈</title>
      <link>https://answer.freetools.me/%E6%95%B0%E6%8D%AE%E5%BA%93buffer-pool%E4%B8%BA%E4%BD%95%E6%8B%92%E7%BB%9Dlru%E4%BB%8Ebelady%E6%9C%80%E4%BC%98%E5%88%B0clock-sweep%E7%9A%84%E5%85%AD%E5%8D%81%E5%B9%B4%E7%AE%97%E6%B3%95%E5%8D%9A%E5%BC%88/</link>
      <pubDate>Sun, 08 Mar 2026 15:44:51 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%95%B0%E6%8D%AE%E5%BA%93buffer-pool%E4%B8%BA%E4%BD%95%E6%8B%92%E7%BB%9Dlru%E4%BB%8Ebelady%E6%9C%80%E4%BC%98%E5%88%B0clock-sweep%E7%9A%84%E5%85%AD%E5%8D%81%E5%B9%B4%E7%AE%97%E6%B3%95%E5%8D%9A%E5%BC%88/</guid>
      <description>深入解析数据库Buffer Pool页面置换算法的演进历程。从1966年Belady最优算法的理论奠基，到LRU-K、2Q、LIRS、ARC等经典算法的设计哲学，再到InnoDB的Midpoint Insertion和PostgreSQL的Clock Sweep生产实践。揭示为什么简单的LRU无法满足数据库需求，以及各大数据库如何用精巧的工程设计解决缓存污染、顺序扫描等核心问题。</description>
    </item>
    <item>
      <title>B&#43;树索引的页分裂：从顺序插入的优雅到随机写入的代价</title>
      <link>https://answer.freetools.me/b-%E6%A0%91%E7%B4%A2%E5%BC%95%E7%9A%84%E9%A1%B5%E5%88%86%E8%A3%82%E4%BB%8E%E9%A1%BA%E5%BA%8F%E6%8F%92%E5%85%A5%E7%9A%84%E4%BC%98%E9%9B%85%E5%88%B0%E9%9A%8F%E6%9C%BA%E5%86%99%E5%85%A5%E7%9A%84%E4%BB%A3%E4%BB%B7/</link>
      <pubDate>Sat, 07 Mar 2026 06:54:38 +0800</pubDate>
      <guid>https://answer.freetools.me/b-%E6%A0%91%E7%B4%A2%E5%BC%95%E7%9A%84%E9%A1%B5%E5%88%86%E8%A3%82%E4%BB%8E%E9%A1%BA%E5%BA%8F%E6%8F%92%E5%85%A5%E7%9A%84%E4%BC%98%E9%9B%85%E5%88%B0%E9%9A%8F%E6%9C%BA%E5%86%99%E5%85%A5%E7%9A%84%E4%BB%A3%E4%BB%B7/</guid>
      <description>深入解析数据库B&#43;树索引页分裂的底层机制。从InnoDB的页面组织结构出发，详细分析顺序插入与随机插入产生的截然不同的页分裂行为，揭示UUID主键导致性能下降的根本原因，并对比不同数据库实现（MySQL、PostgreSQL、SQL Server、DB2）的分裂策略差异。</description>
    </item>
    <item>
      <title>为什么数据库索引选择B&#43;树而不是Hash？从磁盘IO特性到范围查询的技术真相</title>
      <link>https://answer.freetools.me/%E4%B8%BA%E4%BB%80%E4%B9%88%E6%95%B0%E6%8D%AE%E5%BA%93%E7%B4%A2%E5%BC%95%E9%80%89%E6%8B%A9b-%E6%A0%91%E8%80%8C%E4%B8%8D%E6%98%AFhash%E4%BB%8E%E7%A3%81%E7%9B%98io%E7%89%B9%E6%80%A7%E5%88%B0%E8%8C%83%E5%9B%B4%E6%9F%A5%E8%AF%A2%E7%9A%84%E6%8A%80%E6%9C%AF%E7%9C%9F%E7%9B%B8/</link>
      <pubDate>Sat, 07 Mar 2026 05:05:02 +0800</pubDate>
      <guid>https://answer.freetools.me/%E4%B8%BA%E4%BB%80%E4%B9%88%E6%95%B0%E6%8D%AE%E5%BA%93%E7%B4%A2%E5%BC%95%E9%80%89%E6%8B%A9b-%E6%A0%91%E8%80%8C%E4%B8%8D%E6%98%AFhash%E4%BB%8E%E7%A3%81%E7%9B%98io%E7%89%B9%E6%80%A7%E5%88%B0%E8%8C%83%E5%9B%B4%E6%9F%A5%E8%AF%A2%E7%9A%84%E6%8A%80%E6%9C%AF%E7%9C%9F%E7%9B%B8/</guid>
      <description>为什么数据库索引选择B&#43;树而不是Hash？从磁盘IO特性到范围查询的技术真相</description>
    </item>
    <item>
      <title>数据库死锁为何如此难以根除从检测算法到预防策略的五十年博弈</title>
      <link>https://answer.freetools.me/%E6%95%B0%E6%8D%AE%E5%BA%93%E6%AD%BB%E9%94%81%E4%B8%BA%E4%BD%95%E5%A6%82%E6%AD%A4%E9%9A%BE%E4%BB%A5%E6%A0%B9%E9%99%A4%E4%BB%8E%E6%A3%80%E6%B5%8B%E7%AE%97%E6%B3%95%E5%88%B0%E9%A2%84%E9%98%B2%E7%AD%96%E7%95%A5%E7%9A%84%E4%BA%94%E5%8D%81%E5%B9%B4%E5%8D%9A%E5%BC%88/</link>
      <pubDate>Sat, 07 Mar 2026 01:56:28 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%95%B0%E6%8D%AE%E5%BA%93%E6%AD%BB%E9%94%81%E4%B8%BA%E4%BD%95%E5%A6%82%E6%AD%A4%E9%9A%BE%E4%BB%A5%E6%A0%B9%E9%99%A4%E4%BB%8E%E6%A3%80%E6%B5%8B%E7%AE%97%E6%B3%95%E5%88%B0%E9%A2%84%E9%98%B2%E7%AD%96%E7%95%A5%E7%9A%84%E4%BA%94%E5%8D%81%E5%B9%B4%E5%8D%9A%E5%BC%88/</guid>
      <description>深入剖析数据库死锁检测与预防的五十年技术演进：从Coffman四个必要条件到Wait-for Graph检测算法，从Wait-Die/Wound-Wait预防策略到MySQL、PostgreSQL、SQL Server的实现差异。基于IEEE/ACM论文、官方文档和真实生产案例，系统梳理死锁检测的开销与权衡，以及应用层如何设计才能从根本上避免死锁。</description>
    </item>
  </channel>
</rss>
