<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Database on Commentary of Takao</title><link>https://takao.blog/en/categories/database/</link><description>Recent content in Database on Commentary of Takao</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>Commentary of Takao</copyright><lastBuildDate>Sat, 13 Jun 2026 23:11:50 +0900</lastBuildDate><atom:link href="https://takao.blog/en/categories/database/index.xml" rel="self" type="application/rss+xml"/><item><title>Intro to DB Indexing: Resolving Query Latencies</title><link>https://takao.blog/en/web/backend-database-indexing-basics/</link><pubDate>Sun, 25 May 2025 00:00:00 +0900</pubDate><guid>https://takao.blog/en/web/backend-database-indexing-basics/</guid><description>&lt;img src="https://takao.blog/img/thumnail.webp" alt="Featured image of post Intro to DB Indexing: Resolving Query Latencies" /&gt;&lt;h2 id="introduction"&gt;Introduction
&lt;/h2&gt;&lt;p&gt;As web applications scale and data volumes grow, backend systems often face database bottleneck issues like query latencies.&lt;/p&gt;
&lt;p&gt;Running join (&lt;code&gt;JOIN&lt;/code&gt;) operations or complex search queries on tables with hundreds of thousands of records without proper index optimizations can cause database CPU spikes, leading to slow response times for end users.&lt;/p&gt;
&lt;p&gt;Designing database indices is a powerful way to address these performance bottlenecks. This article explains how database indices work, details B-Tree structures, and shares guidelines for designing effective indices.&lt;/p&gt;</description></item></channel></rss>