<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Query Planner on Daniel's Tech Blog</title><link>https://tech.daniellbastos.com.br/tags/query-planner/</link><description>Recent content in Query Planner on Daniel's Tech Blog</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sat, 18 Apr 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://tech.daniellbastos.com.br/tags/query-planner/index.xml" rel="self" type="application/rss+xml"/><item><title>Access Path Selection in a Relational Database Management System - Chapter 5: Joins and the Planner</title><link>https://tech.daniellbastos.com.br/posts/chapter-5-joins-and-planner/</link><pubDate>Sat, 18 Apr 2026 00:00:00 +0000</pubDate><guid>https://tech.daniellbastos.com.br/posts/chapter-5-joins-and-planner/</guid><description>&lt;blockquote&gt;
&lt;p&gt;This post continues the study of &lt;a href="https://courses.cs.duke.edu/compsci516/cps216/spring03/papers/selinger-etal-1979.pdf"&gt;Access Path Selection in a Relational Database Management System (Selinger et al., 1979)&lt;/a&gt;, now covering chapter 5. I used available internet resources and tools to go deeper on the examples and make the concepts more concrete.&lt;/p&gt;
&lt;/blockquote&gt;
&lt;h2 id="what-chapter-5-covers"&gt;What chapter 5 covers&lt;/h2&gt;
&lt;p&gt;Chapter 5 covers joins. The paper describes two methods, nested loops and merging scans, and how the optimizer picks between them. It also describes join order selection: given N tables, which one to read first, which second, which last.&lt;/p&gt;</description></item></channel></rss>