<?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>Storage Engines on martinuke0&#39;s Blog</title>
    <link>https://martinuke0.github.io/tags/storage-engines/</link>
    <description>Recent content in Storage Engines on martinuke0&#39;s Blog</description>
    <image>
      <title>martinuke0&#39;s Blog</title>
      <url>https://martinuke0.github.io/%3Clink%20or%20path%20of%20image%20for%20opengraph,%20twitter-cards%3E</url>
      <link>https://martinuke0.github.io/%3Clink%20or%20path%20of%20image%20for%20opengraph,%20twitter-cards%3E</link>
    </image>
    <generator>Hugo -- 0.152.2</generator>
    <language>en</language>
    <lastBuildDate>Wed, 13 May 2026 11:33:47 +0000</lastBuildDate>
    <atom:link href="https://martinuke0.github.io/tags/storage-engines/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>How LSM Trees Minimize Write Amplification in Distributed Databases</title>
      <link>https://martinuke0.github.io/posts/2026-05-13-how-lsm-trees-minimize-write-amplification-in-distributed-databases/</link>
      <pubDate>Wed, 13 May 2026 11:33:47 +0000</pubDate>
      <guid>https://martinuke0.github.io/posts/2026-05-13-how-lsm-trees-minimize-write-amplification-in-distributed-databases/</guid>
      <description>Explore how Log‑Structured Merge (LSM) trees reduce write amplification in distributed databases, covering compaction strategies, tiered storage, and practical trade‑offs.</description>
    </item>
    <item>
      <title>LSM Trees vs B-Trees: Solving the Write Amplification Tradeoff in Distributed Databases</title>
      <link>https://martinuke0.github.io/posts/2026-05-13-lsm-trees-vs-b-trees-solving-the-write-amplification-tradeoff-in-distributed-databases/</link>
      <pubDate>Wed, 13 May 2026 10:00:51 +0000</pubDate>
      <guid>https://martinuke0.github.io/posts/2026-05-13-lsm-trees-vs-b-trees-solving-the-write-amplification-tradeoff-in-distributed-databases/</guid>
      <description>Explore how LSM trees and B‑trees differ in handling write amplification, and why distributed databases favor one over the other for performance and durability.</description>
    </item>
  </channel>
</rss>
