<?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 Song Kai's Blog</title><link>https://myblog-43r.pages.dev/tags/%E5%AD%98%E5%82%A8%E5%BC%95%E6%93%8E/</link><description>Recent content in 存储引擎 on Song Kai's Blog</description><generator>Hugo</generator><language>zh-cn</language><lastBuildDate>Thu, 24 Sep 2026 21:46:49 +0800</lastBuildDate><atom:link href="https://myblog-43r.pages.dev/tags/%E5%AD%98%E5%82%A8%E5%BC%95%E6%93%8E/index.xml" rel="self" type="application/rss+xml"/><item><title>B+ 树与 LSM 树：读写方式与性能取舍</title><link>https://myblog-43r.pages.dev/posts/lsm-vs-btree/</link><pubDate>Thu, 24 Sep 2026 21:46:49 +0800</pubDate><guid>https://myblog-43r.pages.dev/posts/lsm-vs-btree/</guid><description>从一次记录更新理解 B+ 树与 LSM 树的读写路径、归并成本，以及它们在并发和空间上的取舍。</description></item></channel></rss>