<?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>LSM-Tree on Answer</title>
    <link>https://answer.freetools.me/tags/lsm-tree/</link>
    <description>Recent content in LSM-Tree 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/lsm-tree/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/%E7%B4%A2%E5%BC%95%E8%B6%8A%E5%A4%9A%E6%9F%A5%E8%AF%A2%E8%B6%8A%E6%85%A2%E4%BB%8E%E5%86%99%E5%85%A5%E6%94%BE%E5%A4%A7%E5%88%B0%E4%BC%98%E5%8C%96%E5%99%A8%E8%AF%AF%E5%88%A4%E7%9A%84%E5%AE%8C%E6%95%B4%E6%8A%80%E6%9C%AF%E8%A7%A3%E6%9E%90/</link>
      <pubDate>Fri, 06 Mar 2026 21:42:59 +0800</pubDate>
      <guid>https://answer.freetools.me/%E7%B4%A2%E5%BC%95%E8%B6%8A%E5%A4%9A%E6%9F%A5%E8%AF%A2%E8%B6%8A%E6%85%A2%E4%BB%8E%E5%86%99%E5%85%A5%E6%94%BE%E5%A4%A7%E5%88%B0%E4%BC%98%E5%8C%96%E5%99%A8%E8%AF%AF%E5%88%A4%E7%9A%84%E5%AE%8C%E6%95%B4%E6%8A%80%E6%9C%AF%E8%A7%A3%E6%9E%90/</guid>
      <description>从B-tree的页分裂机制到缓冲池竞争，从优化器基数估计到索引碎片化，深度解析索引隐藏成本的完整技术链条。基于PostgreSQL基准测试数据、pganalyze写入开销模型、SQL Server索引维护指南等权威信源，揭示&amp;#34;索引越多越好&amp;#34;这一认知误区背后的技术真相，以及读密集与写密集场景下的索引设计权衡。</description>
    </item>
    <item>
      <title>时序数据库如何用1.37字节存储一个数据点：从压缩算法到存储引擎的十五年演进</title>
      <link>https://answer.freetools.me/%E6%97%B6%E5%BA%8F%E6%95%B0%E6%8D%AE%E5%BA%93%E5%A6%82%E4%BD%95%E7%94%A81.37%E5%AD%97%E8%8A%82%E5%AD%98%E5%82%A8%E4%B8%80%E4%B8%AA%E6%95%B0%E6%8D%AE%E7%82%B9%E4%BB%8E%E5%8E%8B%E7%BC%A9%E7%AE%97%E6%B3%95%E5%88%B0%E5%AD%98%E5%82%A8%E5%BC%95%E6%93%8E%E7%9A%84%E5%8D%81%E4%BA%94%E5%B9%B4%E6%BC%94%E8%BF%9B/</link>
      <pubDate>Fri, 06 Mar 2026 06:47:20 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%97%B6%E5%BA%8F%E6%95%B0%E6%8D%AE%E5%BA%93%E5%A6%82%E4%BD%95%E7%94%A81.37%E5%AD%97%E8%8A%82%E5%AD%98%E5%82%A8%E4%B8%80%E4%B8%AA%E6%95%B0%E6%8D%AE%E7%82%B9%E4%BB%8E%E5%8E%8B%E7%BC%A9%E7%AE%97%E6%B3%95%E5%88%B0%E5%AD%98%E5%82%A8%E5%BC%95%E6%93%8E%E7%9A%84%E5%8D%81%E4%BA%94%E5%B9%B4%E6%BC%94%E8%BF%9B/</guid>
      <description>深度解析时序数据库的核心技术：Gorilla压缩算法如何实现12倍压缩比、LSM-Tree与B-Tree的存储引擎抉择、高基数问题的根源与解决方案。从Facebook的Gorilla论文到现代TSDB架构，揭示每秒百万级写入背后的技术权衡。</description>
    </item>
  </channel>
</rss>
