<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Database-Internals on Umit Unal</title><link>https://umitunal.net/tags/database-internals/</link><description>Recent content in Database-Internals on Umit Unal</description><generator>Hugo</generator><language>en-us</language><copyright>© 2020 Umit Unal.</copyright><lastBuildDate>Fri, 01 Nov 2024 14:09:07 +0300</lastBuildDate><atom:link href="https://umitunal.net/tags/database-internals/index.xml" rel="self" type="application/rss+xml"/><item><title>Advanced Concepts in LSM Trees: Scaling Write-Optimized Storage</title><link>https://umitunal.net/2024/11/advanced-concepts-in-lsm-trees-scaling-write-optimized-storage/</link><pubDate>Fri, 01 Nov 2024 14:09:07 +0300</pubDate><guid>https://umitunal.net/2024/11/advanced-concepts-in-lsm-trees-scaling-write-optimized-storage/</guid><description>&lt;p&gt;Handling massive volumes of data writes in distributed environments requires data structures built to minimize I/O, balance loads, and retain data integrity. Log-Structured Merge Trees (LSM Trees) accomplish this by intelligently managing writes, compactions, and reads across hierarchical storage levels. This guide will dissect the internal mechanics of LSM Trees, from write batching and SSTable lifecycle management to advanced techniques in compaction and read amplification reduction, all essential for high-performance distributed storage solutions.&lt;/p&gt;</description></item></channel></rss>