<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Relational Database on Daniel's Tech Blog</title><link>https://tech.daniellbastos.com.br/tags/relational-database/</link><description>Recent content in Relational Database on Daniel's Tech Blog</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Fri, 10 Apr 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://tech.daniellbastos.com.br/tags/relational-database/index.xml" rel="self" type="application/rss+xml"/><item><title>Access Path Selection in a Relational Database Management System - Notes Through Chapter 3</title><link>https://tech.daniellbastos.com.br/posts/access-path-selection-relational-database-management-system/</link><pubDate>Fri, 10 Apr 2026 00:00:00 +0000</pubDate><guid>https://tech.daniellbastos.com.br/posts/access-path-selection-relational-database-management-system/</guid><description>&lt;blockquote&gt;
&lt;p&gt;This post is a study dump. I&amp;rsquo;ve been reading &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; and stopped at chapter 3 to consolidate what I learned. I used available internet resource and tools to go deeper on the examples and make the concepts more concrete.&lt;/p&gt;
&lt;/blockquote&gt;
&lt;h2 id="what-the-paper-covers"&gt;What the paper covers&lt;/h2&gt;
&lt;p&gt;The paper describes how System R, an experimental relational database built at IBM in the 1970s, chooses access paths to execute SQL queries. You write SQL declaratively, without specifying how data is accessed or in what order joins happen. The optimizer decides both, minimizing total access cost.&lt;/p&gt;</description></item></channel></rss>