<?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>数据库存储引擎 on Answer</title>
    <link>https://answer.freetools.me/tags/%E6%95%B0%E6%8D%AE%E5%BA%93%E5%AD%98%E5%82%A8%E5%BC%95%E6%93%8E/</link>
    <description>Recent content in 数据库存储引擎 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 15:25:45 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E6%95%B0%E6%8D%AE%E5%BA%93%E5%AD%98%E5%82%A8%E5%BC%95%E6%93%8E/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>LSM-Tree的Compaction为何让数据库工程师又爱又恨：从写放大到读放大的三十年权衡</title>
      <link>https://answer.freetools.me/lsm-tree%E7%9A%84compaction%E4%B8%BA%E4%BD%95%E8%AE%A9%E6%95%B0%E6%8D%AE%E5%BA%93%E5%B7%A5%E7%A8%8B%E5%B8%88%E5%8F%88%E7%88%B1%E5%8F%88%E6%81%A8%E4%BB%8E%E5%86%99%E6%94%BE%E5%A4%A7%E5%88%B0%E8%AF%BB%E6%94%BE%E5%A4%A7%E7%9A%84%E4%B8%89%E5%8D%81%E5%B9%B4%E6%9D%83%E8%A1%A1/</link>
      <pubDate>Sun, 08 Mar 2026 15:25:45 +0800</pubDate>
      <guid>https://answer.freetools.me/lsm-tree%E7%9A%84compaction%E4%B8%BA%E4%BD%95%E8%AE%A9%E6%95%B0%E6%8D%AE%E5%BA%93%E5%B7%A5%E7%A8%8B%E5%B8%88%E5%8F%88%E7%88%B1%E5%8F%88%E6%81%A8%E4%BB%8E%E5%86%99%E6%94%BE%E5%A4%A7%E5%88%B0%E8%AF%BB%E6%94%BE%E5%A4%A7%E7%9A%84%E4%B8%89%E5%8D%81%E5%B9%B4%E6%9D%83%E8%A1%A1/</guid>
      <description>深入解析LSM-Tree Compaction策略的技术本质与演进历程。从1996年Patrick O&amp;#39;Neil等人的原始论文出发，系统梳理Leveled Compaction与Tiered Compaction的核心差异、写放大/读放大/空间放大的数学权衡、RocksDB与Cassandra的生产实践，以及Time Window Compaction等新型策略的设计哲学。揭示Compaction策略选择的关键考量：没有完美方案，只有特定场景下的最优权衡。</description>
    </item>
    <item>
      <title>没有完美的数据结构：从时空权衡到缓存友好的选择之道</title>
      <link>https://answer.freetools.me/%E6%B2%A1%E6%9C%89%E5%AE%8C%E7%BE%8E%E7%9A%84%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%BB%8E%E6%97%B6%E7%A9%BA%E6%9D%83%E8%A1%A1%E5%88%B0%E7%BC%93%E5%AD%98%E5%8F%8B%E5%A5%BD%E7%9A%84%E9%80%89%E6%8B%A9%E4%B9%8B%E9%81%93/</link>
      <pubDate>Fri, 06 Mar 2026 03:33:11 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%B2%A1%E6%9C%89%E5%AE%8C%E7%BE%8E%E7%9A%84%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%BB%8E%E6%97%B6%E7%A9%BA%E6%9D%83%E8%A1%A1%E5%88%B0%E7%BC%93%E5%AD%98%E5%8F%8B%E5%A5%BD%E7%9A%84%E9%80%89%E6%8B%A9%E4%B9%8B%E9%81%93/</guid>
      <description>深入解析数据结构选择的底层逻辑。从B树与LSM树的数据库之争，到跳表为何成为Redis的选择，系统梳理时间复杂度、空间复杂度与缓存性能之间的多维权衡。基于真实系统的工程实践，剖析数据结构选型的决策框架。</description>
    </item>
  </channel>
</rss>
