<?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>2Q on Answer</title>
    <link>https://answer.freetools.me/tags/2q/</link>
    <description>Recent content in 2Q 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/2q/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>
  </channel>
</rss>
